./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:51:57,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:51:57,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:51:57,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:51:57,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:51:57,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:51:57,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:51:57,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:51:57,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:51:57,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:51:57,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:51:57,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:51:57,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:51:57,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:51:57,516 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:51:57,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:51:57,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:51:57,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:51:57,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:51:57,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:51:57,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:51:57,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:51:57,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:51:57,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:51:57,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:51:57,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:51:57,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:51:57,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:51:57,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:51:57,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:51:57,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:51:57,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:51:57,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:51:57,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:51:57,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:51:57,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:51:57,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:51:57,524 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-09 01:51:57,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:51:57,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:51:57,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:51:57,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:51:57,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:51:57,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:51:58,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:51:59,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:51:59,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:51:59,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a679fc0/bcafa389818649a1a19b8e513861807d/FLAG8a97d64fe [2024-11-09 01:51:59,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a679fc0/bcafa389818649a1a19b8e513861807d [2024-11-09 01:51:59,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:51:59,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:51:59,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:51:59,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:51:59,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:51:59,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc516f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59, skipping insertion in model container [2024-11-09 01:51:59,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:51:59,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-09 01:51:59,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:51:59,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:51:59,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-09 01:51:59,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:51:59,819 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:51:59,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59 WrapperNode [2024-11-09 01:51:59,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:51:59,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:51:59,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:51:59,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:51:59,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,873 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2024-11-09 01:51:59,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:51:59,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:51:59,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:51:59,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:51:59,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,906 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:51:59,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:51:59,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:51:59,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:51:59,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:51:59,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (1/1) ... [2024-11-09 01:51:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:51:59,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:51:59,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:51:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:52:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:52:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:52:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:52:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:52:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:52:00,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:52:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 01:52:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:52:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:52:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:52:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:52:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 01:52:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 01:52:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 01:52:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:52:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:52:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:52:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:52:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:52:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:52:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:52:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:52:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:52:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:52:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-09 01:52:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-09 01:52:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-09 01:52:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-09 01:52:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:52:00,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:52:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:52:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:52:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 01:52:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:52:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:52:00,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:52:00,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:52:00,594 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-09 01:52:00,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:52:00,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:52:00,609 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:52:00,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:00 BoogieIcfgContainer [2024-11-09 01:52:00,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:52:00,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:52:00,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:52:00,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:52:00,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:51:59" (1/3) ... [2024-11-09 01:52:00,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f93070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:00, skipping insertion in model container [2024-11-09 01:52:00,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:51:59" (2/3) ... [2024-11-09 01:52:00,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f93070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:00, skipping insertion in model container [2024-11-09 01:52:00,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:00" (3/3) ... [2024-11-09 01:52:00,617 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:52:00,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:52:00,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:52:00,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:52:00,690 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@116eee44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:52:00,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:52:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:00,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:00,704 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:00,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1790010152, now seen corresponding path program 1 times [2024-11-09 01:52:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45960378] [2024-11-09 01:52:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45960378] [2024-11-09 01:52:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45960378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:01,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:52:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178496403] [2024-11-09 01:52:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:01,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:52:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:52:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:01,098 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:01,124 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-09 01:52:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:52:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-09 01:52:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:01,132 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:52:01,132 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:52:01,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:01,137 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:01,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:52:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 01:52:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-09 01:52:01,211 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-09 01:52:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:01,211 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-09 01:52:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-09 01:52:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:01,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:01,220 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:01,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:52:01,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1285386362, now seen corresponding path program 1 times [2024-11-09 01:52:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:01,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080906398] [2024-11-09 01:52:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080906398] [2024-11-09 01:52:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080906398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:01,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678109628] [2024-11-09 01:52:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:01,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:01,517 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:01,553 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-11-09 01:52:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:01,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-09 01:52:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:01,555 INFO L225 Difference]: With dead ends: 211 [2024-11-09 01:52:01,555 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:52:01,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:01,556 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:01,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:52:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:52:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-09 01:52:01,570 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-09 01:52:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:01,571 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-09 01:52:01,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-09 01:52:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:01,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:01,573 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:01,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:52:01,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:01,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 398163516, now seen corresponding path program 1 times [2024-11-09 01:52:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642980520] [2024-11-09 01:52:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642980520] [2024-11-09 01:52:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642980520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024161905] [2024-11-09 01:52:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:01,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:01,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:01,866 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:01,899 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-09 01:52:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-09 01:52:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:01,902 INFO L225 Difference]: With dead ends: 216 [2024-11-09 01:52:01,903 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:52:01,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:01,904 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:01,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:52:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 01:52:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-09 01:52:01,913 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2024-11-09 01:52:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-09 01:52:01,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-09 01:52:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:01,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:01,915 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:01,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:52:01,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:01,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 400010558, now seen corresponding path program 1 times [2024-11-09 01:52:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400205315] [2024-11-09 01:52:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400205315] [2024-11-09 01:52:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400205315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825948237] [2024-11-09 01:52:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:03,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:03,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:03,003 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:03,509 INFO L93 Difference]: Finished difference Result 360 states and 514 transitions. [2024-11-09 01:52:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:52:03,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2024-11-09 01:52:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:03,511 INFO L225 Difference]: With dead ends: 360 [2024-11-09 01:52:03,511 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 01:52:03,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:52:03,513 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 656 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:03,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1095 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 01:52:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 230. [2024-11-09 01:52:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 192 states have internal predecessors, (257), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:52:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 327 transitions. [2024-11-09 01:52:03,546 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 327 transitions. Word has length 130 [2024-11-09 01:52:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 327 transitions. [2024-11-09 01:52:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 327 transitions. [2024-11-09 01:52:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:03,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:03,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:03,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:52:03,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:03,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1101075136, now seen corresponding path program 1 times [2024-11-09 01:52:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778200248] [2024-11-09 01:52:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778200248] [2024-11-09 01:52:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778200248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141780419] [2024-11-09 01:52:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:03,704 INFO L87 Difference]: Start difference. First operand 230 states and 327 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:03,725 INFO L93 Difference]: Finished difference Result 446 states and 638 transitions. [2024-11-09 01:52:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-09 01:52:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:03,728 INFO L225 Difference]: With dead ends: 446 [2024-11-09 01:52:03,728 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 01:52:03,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:03,729 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:03,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 01:52:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-09 01:52:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 196 states have internal predecessors, (261), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:52:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2024-11-09 01:52:03,750 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 130 [2024-11-09 01:52:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:03,751 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2024-11-09 01:52:03,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2024-11-09 01:52:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:03,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:03,752 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:03,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:52:03,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:03,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 822712384, now seen corresponding path program 1 times [2024-11-09 01:52:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313899770] [2024-11-09 01:52:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313899770] [2024-11-09 01:52:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313899770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291372551] [2024-11-09 01:52:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:04,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:04,181 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:04,263 INFO L93 Difference]: Finished difference Result 518 states and 739 transitions. [2024-11-09 01:52:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-09 01:52:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:04,267 INFO L225 Difference]: With dead ends: 518 [2024-11-09 01:52:04,267 INFO L226 Difference]: Without dead ends: 302 [2024-11-09 01:52:04,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:04,269 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 148 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:04,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 814 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-09 01:52:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 221. [2024-11-09 01:52:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 187 states have (on average 1.358288770053476) internal successors, (254), 188 states have internal predecessors, (254), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2024-11-09 01:52:04,288 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 130 [2024-11-09 01:52:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2024-11-09 01:52:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2024-11-09 01:52:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:52:04,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:04,291 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:04,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:52:04,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:04,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -993277358, now seen corresponding path program 1 times [2024-11-09 01:52:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971474908] [2024-11-09 01:52:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971474908] [2024-11-09 01:52:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971474908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480094675] [2024-11-09 01:52:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:04,470 INFO L87 Difference]: Start difference. First operand 221 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:04,497 INFO L93 Difference]: Finished difference Result 445 states and 633 transitions. [2024-11-09 01:52:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-09 01:52:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:04,498 INFO L225 Difference]: With dead ends: 445 [2024-11-09 01:52:04,498 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 01:52:04,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:04,499 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:04,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 01:52:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2024-11-09 01:52:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 190 states have internal predecessors, (256), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2024-11-09 01:52:04,511 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 132 [2024-11-09 01:52:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:04,511 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2024-11-09 01:52:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2024-11-09 01:52:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:04,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:04,513 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:04,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:52:04,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:04,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1160107863, now seen corresponding path program 1 times [2024-11-09 01:52:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419750905] [2024-11-09 01:52:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419750905] [2024-11-09 01:52:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419750905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308578011] [2024-11-09 01:52:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:05,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:05,184 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:05,690 INFO L93 Difference]: Finished difference Result 469 states and 661 transitions. [2024-11-09 01:52:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:52:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-09 01:52:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:05,692 INFO L225 Difference]: With dead ends: 469 [2024-11-09 01:52:05,692 INFO L226 Difference]: Without dead ends: 249 [2024-11-09 01:52:05,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:52:05,693 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 428 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:05,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 815 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-09 01:52:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 223. [2024-11-09 01:52:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 190 states have internal predecessors, (255), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 315 transitions. [2024-11-09 01:52:05,708 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 315 transitions. Word has length 134 [2024-11-09 01:52:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 315 transitions. [2024-11-09 01:52:05,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 315 transitions. [2024-11-09 01:52:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:05,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:05,710 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:05,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:52:05,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash -119755815, now seen corresponding path program 1 times [2024-11-09 01:52:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880487083] [2024-11-09 01:52:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880487083] [2024-11-09 01:52:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880487083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:52:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8694077] [2024-11-09 01:52:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:52:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:07,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:52:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:52:07,335 INFO L87 Difference]: Start difference. First operand 223 states and 315 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:08,874 INFO L93 Difference]: Finished difference Result 597 states and 827 transitions. [2024-11-09 01:52:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:52:08,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-09 01:52:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:08,876 INFO L225 Difference]: With dead ends: 597 [2024-11-09 01:52:08,876 INFO L226 Difference]: Without dead ends: 376 [2024-11-09 01:52:08,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2024-11-09 01:52:08,878 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 909 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:08,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1286 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:52:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-09 01:52:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 230. [2024-11-09 01:52:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 197 states have internal predecessors, (265), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2024-11-09 01:52:08,897 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 134 [2024-11-09 01:52:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:08,897 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2024-11-09 01:52:08,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2024-11-09 01:52:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:08,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:08,899 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:52:08,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 459215189, now seen corresponding path program 1 times [2024-11-09 01:52:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167978475] [2024-11-09 01:52:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-09 01:52:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167978475] [2024-11-09 01:52:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167978475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:52:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256502879] [2024-11-09 01:52:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:10,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:10,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:10,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:10,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:52:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:10,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:52:10,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:10,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:11,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-09 01:52:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:11,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256502879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:52:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-09 01:52:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562931493] [2024-11-09 01:52:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:11,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:52:11,229 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:11,758 INFO L93 Difference]: Finished difference Result 507 states and 716 transitions. [2024-11-09 01:52:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:11,760 INFO L225 Difference]: With dead ends: 507 [2024-11-09 01:52:11,760 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 01:52:11,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:52:11,761 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 253 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:11,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 499 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:52:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 01:52:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 258. [2024-11-09 01:52:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 225 states have internal predecessors, (304), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-11-09 01:52:11,782 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 134 [2024-11-09 01:52:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:11,783 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-11-09 01:52:11,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-11-09 01:52:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:11,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:11,784 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:11,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:52:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:52:11,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 859645068, now seen corresponding path program 1 times [2024-11-09 01:52:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805805925] [2024-11-09 01:52:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805805925] [2024-11-09 01:52:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805805925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876119218] [2024-11-09 01:52:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:12,419 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:12,662 INFO L93 Difference]: Finished difference Result 535 states and 751 transitions. [2024-11-09 01:52:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:12,664 INFO L225 Difference]: With dead ends: 535 [2024-11-09 01:52:12,664 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 01:52:12,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:52:12,665 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 69 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:12,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1320 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 01:52:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2024-11-09 01:52:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.3508771929824561) internal successors, (308), 229 states have internal predecessors, (308), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 368 transitions. [2024-11-09 01:52:12,685 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 368 transitions. Word has length 134 [2024-11-09 01:52:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:12,686 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 368 transitions. [2024-11-09 01:52:12,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2024-11-09 01:52:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:12,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:12,687 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:12,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:52:12,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1560709646, now seen corresponding path program 1 times [2024-11-09 01:52:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122718524] [2024-11-09 01:52:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122718524] [2024-11-09 01:52:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122718524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:13,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:52:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593769237] [2024-11-09 01:52:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:13,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:52:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:52:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:52:13,085 INFO L87 Difference]: Start difference. First operand 262 states and 368 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:13,348 INFO L93 Difference]: Finished difference Result 533 states and 746 transitions. [2024-11-09 01:52:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:52:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-09 01:52:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:13,350 INFO L225 Difference]: With dead ends: 533 [2024-11-09 01:52:13,350 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 01:52:13,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:52:13,351 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 387 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 649 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 01:52:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-11-09 01:52:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 235 states have internal predecessors, (312), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 378 transitions. [2024-11-09 01:52:13,370 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 378 transitions. Word has length 134 [2024-11-09 01:52:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:13,370 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 378 transitions. [2024-11-09 01:52:13,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 378 transitions. [2024-11-09 01:52:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:13,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:13,372 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:13,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:52:13,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:13,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1300656473, now seen corresponding path program 1 times [2024-11-09 01:52:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159801717] [2024-11-09 01:52:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-09 01:52:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159801717] [2024-11-09 01:52:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159801717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:52:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169498474] [2024-11-09 01:52:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:14,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:14,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:14,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:14,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:52:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:14,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:52:14,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:14,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:52:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:14,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-09 01:52:14,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 01:52:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-09 01:52:14,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:52:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:14,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169498474] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:52:14,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:52:14,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2024-11-09 01:52:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395689199] [2024-11-09 01:52:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:14,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:52:14,984 INFO L87 Difference]: Start difference. First operand 271 states and 378 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:15,070 INFO L93 Difference]: Finished difference Result 584 states and 806 transitions. [2024-11-09 01:52:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:15,074 INFO L225 Difference]: With dead ends: 584 [2024-11-09 01:52:15,074 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 01:52:15,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:52:15,075 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:15,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 431 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 01:52:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 266. [2024-11-09 01:52:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 228 states have (on average 1.3245614035087718) internal successors, (302), 230 states have internal predecessors, (302), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 368 transitions. [2024-11-09 01:52:15,097 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 368 transitions. Word has length 134 [2024-11-09 01:52:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:15,097 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 368 transitions. [2024-11-09 01:52:15,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 368 transitions. [2024-11-09 01:52:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:15,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:15,098 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:15,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:52:15,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:52:15,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:15,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1000193678, now seen corresponding path program 1 times [2024-11-09 01:52:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491890691] [2024-11-09 01:52:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491890691] [2024-11-09 01:52:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491890691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946672425] [2024-11-09 01:52:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:15,530 INFO L87 Difference]: Start difference. First operand 266 states and 368 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:15,643 INFO L93 Difference]: Finished difference Result 559 states and 767 transitions. [2024-11-09 01:52:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:15,645 INFO L225 Difference]: With dead ends: 559 [2024-11-09 01:52:15,645 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 01:52:15,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:15,646 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:15,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 647 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 01:52:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2024-11-09 01:52:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.321285140562249) internal successors, (329), 251 states have internal predecessors, (329), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-11-09 01:52:15,665 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 134 [2024-11-09 01:52:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-11-09 01:52:15,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-11-09 01:52:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:15,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:15,666 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:15,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:52:15,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1701258256, now seen corresponding path program 1 times [2024-11-09 01:52:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729752756] [2024-11-09 01:52:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729752756] [2024-11-09 01:52:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729752756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893008122] [2024-11-09 01:52:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:16,225 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:16,525 INFO L93 Difference]: Finished difference Result 590 states and 806 transitions. [2024-11-09 01:52:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:16,527 INFO L225 Difference]: With dead ends: 590 [2024-11-09 01:52:16,527 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 01:52:16,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:52:16,528 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 62 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:16,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1493 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 01:52:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2024-11-09 01:52:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 251 states have (on average 1.3187250996015936) internal successors, (331), 253 states have internal predecessors, (331), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2024-11-09 01:52:16,549 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 134 [2024-11-09 01:52:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:16,549 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2024-11-09 01:52:16,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2024-11-09 01:52:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:16,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:16,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:16,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:52:16,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:16,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1996854690, now seen corresponding path program 1 times [2024-11-09 01:52:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755853704] [2024-11-09 01:52:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755853704] [2024-11-09 01:52:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755853704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:16,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765778704] [2024-11-09 01:52:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:16,946 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:17,236 INFO L93 Difference]: Finished difference Result 656 states and 894 transitions. [2024-11-09 01:52:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:17,238 INFO L225 Difference]: With dead ends: 656 [2024-11-09 01:52:17,238 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 01:52:17,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:52:17,239 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 70 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:17,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1441 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 01:52:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 325. [2024-11-09 01:52:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 286 states have (on average 1.3286713286713288) internal successors, (380), 288 states have internal predecessors, (380), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 446 transitions. [2024-11-09 01:52:17,262 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 446 transitions. Word has length 134 [2024-11-09 01:52:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 446 transitions. [2024-11-09 01:52:17,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2024-11-09 01:52:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:17,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:17,264 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:52:17,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1295790112, now seen corresponding path program 1 times [2024-11-09 01:52:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395120658] [2024-11-09 01:52:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395120658] [2024-11-09 01:52:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395120658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:52:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843564586] [2024-11-09 01:52:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:52:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:52:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:52:17,648 INFO L87 Difference]: Start difference. First operand 325 states and 446 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:17,918 INFO L93 Difference]: Finished difference Result 678 states and 927 transitions. [2024-11-09 01:52:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:52:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-09 01:52:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:17,920 INFO L225 Difference]: With dead ends: 678 [2024-11-09 01:52:17,920 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 01:52:17,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:52:17,921 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 207 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:17,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 757 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 01:52:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 324. [2024-11-09 01:52:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 285 states have (on average 1.3263157894736841) internal successors, (378), 287 states have internal predecessors, (378), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2024-11-09 01:52:17,939 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 134 [2024-11-09 01:52:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:17,939 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2024-11-09 01:52:17,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2024-11-09 01:52:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:17,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:17,941 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:17,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:52:17,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1596424811, now seen corresponding path program 1 times [2024-11-09 01:52:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311894742] [2024-11-09 01:52:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311894742] [2024-11-09 01:52:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311894742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:52:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607438141] [2024-11-09 01:52:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:18,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:52:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:52:18,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:18,581 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:18,996 INFO L93 Difference]: Finished difference Result 662 states and 905 transitions. [2024-11-09 01:52:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:18,998 INFO L225 Difference]: With dead ends: 662 [2024-11-09 01:52:18,998 INFO L226 Difference]: Without dead ends: 341 [2024-11-09 01:52:18,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:52:18,999 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 279 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:18,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 610 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-09 01:52:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 319. [2024-11-09 01:52:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 282 states have internal predecessors, (369), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 01:52:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 435 transitions. [2024-11-09 01:52:19,017 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 435 transitions. Word has length 134 [2024-11-09 01:52:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 435 transitions. [2024-11-09 01:52:19,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 435 transitions. [2024-11-09 01:52:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:19,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:19,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:52:19,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1856306080, now seen corresponding path program 1 times [2024-11-09 01:52:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402470364] [2024-11-09 01:52:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:19,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:19,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402470364] [2024-11-09 01:52:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402470364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405974121] [2024-11-09 01:52:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:19,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:19,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:19,216 INFO L87 Difference]: Start difference. First operand 319 states and 435 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:19,327 INFO L93 Difference]: Finished difference Result 654 states and 886 transitions. [2024-11-09 01:52:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:19,329 INFO L225 Difference]: With dead ends: 654 [2024-11-09 01:52:19,329 INFO L226 Difference]: Without dead ends: 338 [2024-11-09 01:52:19,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:19,330 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 59 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:19,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 650 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-09 01:52:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2024-11-09 01:52:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 261 states have (on average 1.314176245210728) internal successors, (343), 262 states have internal predecessors, (343), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 403 transitions. [2024-11-09 01:52:19,347 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 403 transitions. Word has length 134 [2024-11-09 01:52:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 403 transitions. [2024-11-09 01:52:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 403 transitions. [2024-11-09 01:52:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:52:19,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:19,349 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:52:19,350 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1155241502, now seen corresponding path program 1 times [2024-11-09 01:52:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356671031] [2024-11-09 01:52:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356671031] [2024-11-09 01:52:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356671031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:19,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312010128] [2024-11-09 01:52:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:19,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:19,719 INFO L87 Difference]: Start difference. First operand 297 states and 403 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:19,957 INFO L93 Difference]: Finished difference Result 630 states and 851 transitions. [2024-11-09 01:52:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-09 01:52:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:19,961 INFO L225 Difference]: With dead ends: 630 [2024-11-09 01:52:19,962 INFO L226 Difference]: Without dead ends: 336 [2024-11-09 01:52:19,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:52:19,963 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 66 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:19,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1678 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-09 01:52:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 333. [2024-11-09 01:52:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.303448275862069) internal successors, (378), 292 states have internal predecessors, (378), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:52:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 448 transitions. [2024-11-09 01:52:19,989 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 448 transitions. Word has length 134 [2024-11-09 01:52:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:19,990 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 448 transitions. [2024-11-09 01:52:19,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 448 transitions. [2024-11-09 01:52:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:52:19,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:19,991 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:19,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:52:19,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:19,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash 259226415, now seen corresponding path program 1 times [2024-11-09 01:52:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185283042] [2024-11-09 01:52:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185283042] [2024-11-09 01:52:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185283042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:52:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468069054] [2024-11-09 01:52:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:20,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:52:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:52:20,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:52:20,372 INFO L87 Difference]: Start difference. First operand 333 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:20,569 INFO L93 Difference]: Finished difference Result 757 states and 1009 transitions. [2024-11-09 01:52:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:52:20,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-09 01:52:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:20,572 INFO L225 Difference]: With dead ends: 757 [2024-11-09 01:52:20,572 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 01:52:20,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:52:20,573 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 248 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:20,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 599 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 01:52:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 345. [2024-11-09 01:52:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 302 states have (on average 1.304635761589404) internal successors, (394), 304 states have internal predecessors, (394), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:52:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 464 transitions. [2024-11-09 01:52:20,607 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 464 transitions. Word has length 135 [2024-11-09 01:52:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:20,607 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 464 transitions. [2024-11-09 01:52:20,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 464 transitions. [2024-11-09 01:52:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:20,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:20,609 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:20,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:52:20,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:20,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1008176994, now seen corresponding path program 1 times [2024-11-09 01:52:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997339606] [2024-11-09 01:52:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997339606] [2024-11-09 01:52:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997339606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:52:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768213849] [2024-11-09 01:52:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:52:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:52:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:20,954 INFO L87 Difference]: Start difference. First operand 345 states and 464 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:21,074 INFO L93 Difference]: Finished difference Result 380 states and 503 transitions. [2024-11-09 01:52:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:52:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-09 01:52:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:21,076 INFO L225 Difference]: With dead ends: 380 [2024-11-09 01:52:21,076 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 01:52:21,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:21,077 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:21,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 852 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 01:52:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 230. [2024-11-09 01:52:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 211 states have (on average 1.3222748815165877) internal successors, (279), 211 states have internal predecessors, (279), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 309 transitions. [2024-11-09 01:52:21,092 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 309 transitions. Word has length 137 [2024-11-09 01:52:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:21,092 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 309 transitions. [2024-11-09 01:52:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 309 transitions. [2024-11-09 01:52:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:21,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:21,094 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:21,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:52:21,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1006329952, now seen corresponding path program 1 times [2024-11-09 01:52:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81020302] [2024-11-09 01:52:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81020302] [2024-11-09 01:52:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81020302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:52:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698609910] [2024-11-09 01:52:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:21,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:52:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:52:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:52:21,840 INFO L87 Difference]: Start difference. First operand 230 states and 309 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:22,178 INFO L93 Difference]: Finished difference Result 559 states and 740 transitions. [2024-11-09 01:52:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:52:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-09 01:52:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:22,180 INFO L225 Difference]: With dead ends: 559 [2024-11-09 01:52:22,180 INFO L226 Difference]: Without dead ends: 332 [2024-11-09 01:52:22,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:52:22,181 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 331 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:22,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1002 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-09 01:52:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 268. [2024-11-09 01:52:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 249 states have internal predecessors, (328), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 358 transitions. [2024-11-09 01:52:22,195 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 358 transitions. Word has length 137 [2024-11-09 01:52:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 358 transitions. [2024-11-09 01:52:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 358 transitions. [2024-11-09 01:52:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:22,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:22,196 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 01:52:22,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1825075018, now seen corresponding path program 1 times [2024-11-09 01:52:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576235809] [2024-11-09 01:52:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576235809] [2024-11-09 01:52:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576235809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:52:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751962596] [2024-11-09 01:52:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:52:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:52:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:22,476 INFO L87 Difference]: Start difference. First operand 268 states and 358 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:22,797 INFO L93 Difference]: Finished difference Result 779 states and 1034 transitions. [2024-11-09 01:52:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:52:22,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-09 01:52:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:22,800 INFO L225 Difference]: With dead ends: 779 [2024-11-09 01:52:22,800 INFO L226 Difference]: Without dead ends: 512 [2024-11-09 01:52:22,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:52:22,804 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 240 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:22,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1164 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-09 01:52:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 275. [2024-11-09 01:52:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 256 states have (on average 1.31640625) internal successors, (337), 256 states have internal predecessors, (337), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 367 transitions. [2024-11-09 01:52:22,821 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 367 transitions. Word has length 137 [2024-11-09 01:52:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:22,821 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 367 transitions. [2024-11-09 01:52:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 367 transitions. [2024-11-09 01:52:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:22,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:22,822 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:52:22,823 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1007426568, now seen corresponding path program 1 times [2024-11-09 01:52:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564346201] [2024-11-09 01:52:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564346201] [2024-11-09 01:52:23,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564346201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:23,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:23,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:52:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248317698] [2024-11-09 01:52:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:23,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:52:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:52:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:52:23,211 INFO L87 Difference]: Start difference. First operand 275 states and 367 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:23,461 INFO L93 Difference]: Finished difference Result 749 states and 991 transitions. [2024-11-09 01:52:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:52:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-09 01:52:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:23,464 INFO L225 Difference]: With dead ends: 749 [2024-11-09 01:52:23,464 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 01:52:23,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:52:23,465 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 147 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:23,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 2004 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 01:52:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 276. [2024-11-09 01:52:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 257 states have (on average 1.3190661478599222) internal successors, (339), 257 states have internal predecessors, (339), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 369 transitions. [2024-11-09 01:52:23,487 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 369 transitions. Word has length 137 [2024-11-09 01:52:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:23,487 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 369 transitions. [2024-11-09 01:52:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 369 transitions. [2024-11-09 01:52:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:23,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:23,488 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:23,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:52:23,488 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1768047004, now seen corresponding path program 1 times [2024-11-09 01:52:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196300040] [2024-11-09 01:52:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196300040] [2024-11-09 01:52:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196300040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:24,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:24,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:52:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761336229] [2024-11-09 01:52:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:24,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:52:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:52:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:52:24,074 INFO L87 Difference]: Start difference. First operand 276 states and 369 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:24,361 INFO L93 Difference]: Finished difference Result 688 states and 917 transitions. [2024-11-09 01:52:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-09 01:52:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:24,364 INFO L225 Difference]: With dead ends: 688 [2024-11-09 01:52:24,364 INFO L226 Difference]: Without dead ends: 415 [2024-11-09 01:52:24,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:52:24,366 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 239 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:24,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1049 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-09 01:52:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 378. [2024-11-09 01:52:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.3286908077994428) internal successors, (477), 359 states have internal predecessors, (477), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 507 transitions. [2024-11-09 01:52:24,384 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 507 transitions. Word has length 137 [2024-11-09 01:52:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:24,385 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 507 transitions. [2024-11-09 01:52:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 507 transitions. [2024-11-09 01:52:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:24,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:24,386 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 01:52:24,386 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1699501690, now seen corresponding path program 1 times [2024-11-09 01:52:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030981221] [2024-11-09 01:52:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030981221] [2024-11-09 01:52:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030981221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:52:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527937616] [2024-11-09 01:52:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:25,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:52:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:52:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:52:25,043 INFO L87 Difference]: Start difference. First operand 378 states and 507 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:25,583 INFO L93 Difference]: Finished difference Result 1029 states and 1359 transitions. [2024-11-09 01:52:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:52:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-09 01:52:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:25,586 INFO L225 Difference]: With dead ends: 1029 [2024-11-09 01:52:25,586 INFO L226 Difference]: Without dead ends: 654 [2024-11-09 01:52:25,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:52:25,587 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 266 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2278 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:52:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-09 01:52:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 378. [2024-11-09 01:52:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.3286908077994428) internal successors, (477), 359 states have internal predecessors, (477), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 507 transitions. [2024-11-09 01:52:25,608 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 507 transitions. Word has length 137 [2024-11-09 01:52:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:25,608 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 507 transitions. [2024-11-09 01:52:25,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 507 transitions. [2024-11-09 01:52:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:25,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:25,609 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 01:52:25,609 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1777817156, now seen corresponding path program 1 times [2024-11-09 01:52:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874156975] [2024-11-09 01:52:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874156975] [2024-11-09 01:52:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874156975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:52:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143115487] [2024-11-09 01:52:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:25,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:52:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:52:25,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:52:25,968 INFO L87 Difference]: Start difference. First operand 378 states and 507 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:26,323 INFO L93 Difference]: Finished difference Result 1006 states and 1332 transitions. [2024-11-09 01:52:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:52:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-09 01:52:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:26,326 INFO L225 Difference]: With dead ends: 1006 [2024-11-09 01:52:26,326 INFO L226 Difference]: Without dead ends: 631 [2024-11-09 01:52:26,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:52:26,327 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 369 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:26,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1356 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-09 01:52:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 366. [2024-11-09 01:52:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 347 states have internal predecessors, (455), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2024-11-09 01:52:26,347 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 137 [2024-11-09 01:52:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2024-11-09 01:52:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2024-11-09 01:52:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:26,348 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 01:52:26,349 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -904939233, now seen corresponding path program 1 times [2024-11-09 01:52:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067034025] [2024-11-09 01:52:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067034025] [2024-11-09 01:52:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067034025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:26,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:52:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689161079] [2024-11-09 01:52:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:26,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:52:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:52:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:52:26,943 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:27,623 INFO L93 Difference]: Finished difference Result 830 states and 1094 transitions. [2024-11-09 01:52:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:52:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-09 01:52:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:27,626 INFO L225 Difference]: With dead ends: 830 [2024-11-09 01:52:27,626 INFO L226 Difference]: Without dead ends: 467 [2024-11-09 01:52:27,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:52:27,627 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 412 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:27,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 901 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:52:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-09 01:52:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 344. [2024-11-09 01:52:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 325 states have (on average 1.2953846153846154) internal successors, (421), 325 states have internal predecessors, (421), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 451 transitions. [2024-11-09 01:52:27,650 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 451 transitions. Word has length 137 [2024-11-09 01:52:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 451 transitions. [2024-11-09 01:52:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 451 transitions. [2024-11-09 01:52:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:52:27,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:27,652 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 01:52:27,652 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1414412323, now seen corresponding path program 1 times [2024-11-09 01:52:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388383567] [2024-11-09 01:52:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388383567] [2024-11-09 01:52:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388383567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:28,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:52:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966428006] [2024-11-09 01:52:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:52:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:52:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:28,045 INFO L87 Difference]: Start difference. First operand 344 states and 451 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:28,463 INFO L93 Difference]: Finished difference Result 780 states and 1018 transitions. [2024-11-09 01:52:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:52:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-09 01:52:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:28,465 INFO L225 Difference]: With dead ends: 780 [2024-11-09 01:52:28,465 INFO L226 Difference]: Without dead ends: 439 [2024-11-09 01:52:28,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:52:28,466 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 348 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:28,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 986 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-09 01:52:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 316. [2024-11-09 01:52:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 297 states have internal predecessors, (379), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 409 transitions. [2024-11-09 01:52:28,490 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 409 transitions. Word has length 137 [2024-11-09 01:52:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:28,491 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 409 transitions. [2024-11-09 01:52:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 409 transitions. [2024-11-09 01:52:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:52:28,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:28,492 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 01:52:28,492 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:28,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1050783877, now seen corresponding path program 1 times [2024-11-09 01:52:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:28,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128297200] [2024-11-09 01:52:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128297200] [2024-11-09 01:52:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128297200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:28,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:28,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:52:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586311437] [2024-11-09 01:52:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:52:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:52:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:52:28,944 INFO L87 Difference]: Start difference. First operand 316 states and 409 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:29,284 INFO L93 Difference]: Finished difference Result 670 states and 864 transitions. [2024-11-09 01:52:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:52:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 139 [2024-11-09 01:52:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:29,287 INFO L225 Difference]: With dead ends: 670 [2024-11-09 01:52:29,287 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 01:52:29,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:52:29,287 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 402 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:29,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 615 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:52:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 01:52:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 316. [2024-11-09 01:52:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 297 states have (on average 1.2727272727272727) internal successors, (378), 297 states have internal predecessors, (378), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 408 transitions. [2024-11-09 01:52:29,314 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 408 transitions. Word has length 139 [2024-11-09 01:52:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:29,315 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 408 transitions. [2024-11-09 01:52:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 01:52:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 408 transitions. [2024-11-09 01:52:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:52:29,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:29,316 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 01:52:29,316 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1191332487, now seen corresponding path program 1 times [2024-11-09 01:52:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682699306] [2024-11-09 01:52:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:52:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411867733] [2024-11-09 01:52:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:29,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:29,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:29,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:52:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 01:52:30,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:30,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 01:52:30,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:52:31,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-09 01:52:31,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (select (select |c_#memory_int#7| |c_~#var_1_12~0.base|) |c_~#var_1_12~0.offset|) 4294967296)) (.cse2 (mod (+ (mod (select (select |c_#memory_int#13| |c_~#var_1_18~0.base|) |c_~#var_1_18~0.offset|) 256) 4294967232) 4294967296)) (.cse5 (= |c_~#var_1_3~0.base| c_~var_1_3_Pointer~0.base)) (.cse0 (= |c_~#var_1_3~0.offset| c_~var_1_3_Pointer~0.offset))) (and (or (not .cse0) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse3 (* v_y_3 4294967296))) (let ((.cse4 (+ v_z_3 .cse3))) (or (not (= (div .cse1 v_z_3) .cse2)) (< 4294967295 v_z_3) (< (+ v_z_3 32768 .cse3) 0) (< 32767 .cse4) (< v_z_3 0) (= .cse4 0))))) (not .cse5)) (or (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (not (= (mod (div .cse1 v_z_2) 4294967296) .cse2)) (< v_z_2 0))) (and .cse5 .cse0)))) is different from false [2024-11-09 01:52:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-09 01:52:31,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682699306] [2024-11-09 01:52:31,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:52:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411867733] [2024-11-09 01:52:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411867733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:52:31,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:52:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-09 01:52:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382794922] [2024-11-09 01:52:31,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:52:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:52:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:31,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:52:31,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=245, Unknown=6, NotChecked=32, Total=342 [2024-11-09 01:52:31,675 INFO L87 Difference]: Start difference. First operand 316 states and 408 transitions. Second operand has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-09 01:52:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:32,715 INFO L93 Difference]: Finished difference Result 836 states and 1078 transitions. [2024-11-09 01:52:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:52:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 139 [2024-11-09 01:52:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:32,718 INFO L225 Difference]: With dead ends: 836 [2024-11-09 01:52:32,718 INFO L226 Difference]: Without dead ends: 523 [2024-11-09 01:52:32,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=588, Unknown=6, NotChecked=54, Total=870 [2024-11-09 01:52:32,719 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 430 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:32,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 461 Invalid, 0 Unknown, 182 Unchecked, 0.6s Time] [2024-11-09 01:52:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-09 01:52:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 384. [2024-11-09 01:52:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 347 states have (on average 1.2680115273775217) internal successors, (440), 347 states have internal predecessors, (440), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 500 transitions. [2024-11-09 01:52:32,793 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 500 transitions. Word has length 139 [2024-11-09 01:52:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 500 transitions. [2024-11-09 01:52:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-09 01:52:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 500 transitions. [2024-11-09 01:52:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:52:32,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:32,794 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:32,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:52:32,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:32,995 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1938585677, now seen corresponding path program 1 times [2024-11-09 01:52:32,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:32,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436448249] [2024-11-09 01:52:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:52:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:52:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:52:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:52:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:52:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:52:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:52:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:52:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436448249] [2024-11-09 01:52:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436448249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:52:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067222776] [2024-11-09 01:52:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:33,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:33,298 INFO L87 Difference]: Start difference. First operand 384 states and 500 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:33,454 INFO L93 Difference]: Finished difference Result 738 states and 954 transitions. [2024-11-09 01:52:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-09 01:52:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:33,456 INFO L225 Difference]: With dead ends: 738 [2024-11-09 01:52:33,456 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 01:52:33,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:33,457 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 62 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:33,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 631 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 01:52:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 384. [2024-11-09 01:52:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 347 states have (on average 1.2651296829971181) internal successors, (439), 347 states have internal predecessors, (439), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:52:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 499 transitions. [2024-11-09 01:52:33,502 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 499 transitions. Word has length 139 [2024-11-09 01:52:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:33,502 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 499 transitions. [2024-11-09 01:52:33,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:52:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 499 transitions. [2024-11-09 01:52:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:52:33,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:33,503 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 01:52:33,503 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1798037067, now seen corresponding path program 1 times [2024-11-09 01:52:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548612044] [2024-11-09 01:52:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:52:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77940825] [2024-11-09 01:52:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:33,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:33,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:33,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:33,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:52:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:52:34,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:52:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:52:34,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:52:34,523 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:52:34,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:52:34,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:52:34,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:34,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:34,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:52:34,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:52:34 BoogieIcfgContainer [2024-11-09 01:52:34,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:52:34,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:52:34,864 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:52:34,864 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:52:34,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:00" (3/4) ... [2024-11-09 01:52:34,867 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:52:34,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:52:34,869 INFO L158 Benchmark]: Toolchain (without parser) took 35368.91ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 975.2MB). Free memory was 78.7MB in the beginning and 490.1MB in the end (delta: -411.4MB). Peak memory consumption was 565.5MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,870 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:52:34,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.99ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 78.5MB in the beginning and 168.1MB in the end (delta: -89.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.64ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 163.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,870 INFO L158 Benchmark]: Boogie Preprocessor took 65.46ms. Allocated memory is still 199.2MB. Free memory was 163.9MB in the beginning and 158.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,871 INFO L158 Benchmark]: RCFGBuilder took 669.30ms. Allocated memory is still 199.2MB. Free memory was 158.4MB in the beginning and 111.5MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,871 INFO L158 Benchmark]: TraceAbstraction took 34252.87ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 110.4MB in the beginning and 490.1MB in the end (delta: -379.7MB). Peak memory consumption was 546.2MB. Max. memory is 16.1GB. [2024-11-09 01:52:34,872 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 1.1GB. Free memory is still 490.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:52:34,873 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.99ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 78.5MB in the beginning and 168.1MB in the end (delta: -89.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.64ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 163.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.46ms. Allocated memory is still 199.2MB. Free memory was 163.9MB in the beginning and 158.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 669.30ms. Allocated memory is still 199.2MB. Free memory was 158.4MB in the beginning and 111.5MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 34252.87ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 110.4MB in the beginning and 490.1MB in the end (delta: -379.7MB). Peak memory consumption was 546.2MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 1.1GB. Free memory is still 490.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L22] unsigned short int var_1_1 = 5; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_3 = -25; [L24] signed short int var_1_3 = -25; [L25] signed short int* var_1_3_Pointer = &(var_1_3); [L26] unsigned short int var_1_7 = 4; [L26] unsigned short int var_1_7 = 4; [L27] unsigned short int* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 4; [L28] unsigned char var_1_8 = 4; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_10 = 4; [L30] unsigned char var_1_10 = 4; [L31] unsigned char* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 8; [L32] unsigned char var_1_11 = 8; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned long int var_1_12 = 10; [L34] unsigned long int var_1_12 = 10; [L35] unsigned long int* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 99.6; [L36] float var_1_13 = 99.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 127.5; [L38] float var_1_14 = 127.5; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 16.5; [L40] float var_1_15 = 16.5; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.5; [L42] float var_1_16 = 256.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] unsigned long int var_1_17 = 4288034294; [L44] unsigned long int var_1_17 = 4288034294; [L45] unsigned long int* var_1_17_Pointer = &(var_1_17); [L46] unsigned char var_1_18 = 0; [L46] unsigned char var_1_18 = 0; [L47] unsigned char* var_1_18_Pointer = &(var_1_18); [L48] unsigned long int last_1_var_1_12 = 10; [L49] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L101] EXPR \read(var_1_18) [L101] last_1_var_1_18 = var_1_18 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L85] var_1_13 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L87] var_1_14 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L95] var_1_17 = __VERIFIER_nondet_ulong() [L96] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_3_Pointer) [L53] unsigned long int stepLocal_2 = last_1_var_1_12 / (*(var_1_3_Pointer)); [L54] COND TRUE stepLocal_2 != (last_1_var_1_18 - 64) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] (*(var_1_8_Pointer)) = (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))) [L59] EXPR \read(*var_1_13_Pointer) [L59] EXPR \read(*var_1_14_Pointer) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] COND TRUE (- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer)))))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) [L60] EXPR \read(*var_1_8_Pointer) [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] (*(var_1_12_Pointer)) = (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))) [L64] EXPR \read(*var_1_11_Pointer) [L64] (*(var_1_18_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_18_Pointer) [L65] (*(var_1_7_Pointer)) = (*(var_1_18_Pointer)) [L66] EXPR \read(*var_1_3_Pointer) [L66] signed long int stepLocal_1 = - (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_7_Pointer) [L67] EXPR \read(*var_1_3_Pointer) [L67] signed long int stepLocal_0 = (*(var_1_7_Pointer)) / (*(var_1_3_Pointer)); [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L68] COND FALSE !(stepLocal_0 >= (*(var_1_7_Pointer))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_18_Pointer) [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) [L104] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) [L104] EXPR \read(*var_1_13_Pointer) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR \read(*var_1_17_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104-L105] return (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 34, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7279 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7279 mSDsluCounter, 31126 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 182 IncrementalHoareTripleChecker+Unchecked, 25117 mSDsCounter, 730 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7700 IncrementalHoareTripleChecker+Invalid, 8612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 730 mSolverCounterUnsat, 6009 mSDtfsCounter, 7700 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2117 GetRequests, 1730 SyntacticMatches, 4 SemanticMatches, 383 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=32, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 2330 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 5124 NumberOfCodeBlocks, 5124 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4943 ConstructedInterpolants, 4 QuantifiedInterpolants, 24548 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1787 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 37 InterpolantComputations, 32 PerfectInterpolantSequences, 15200/15540 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:52:34,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:52:36,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:52:36,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:52:36,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:52:36,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:52:36,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:52:36,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:52:36,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:52:36,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:52:36,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:52:36,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:52:36,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:52:36,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:52:36,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:52:36,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:52:36,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:52:36,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:52:36,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:52:36,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:52:36,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:52:36,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:52:36,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:52:36,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:52:36,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:52:36,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:52:36,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:52:36,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:52:36,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:52:36,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:52:36,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:36,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:52:36,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:52:36,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:52:36,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:52:36,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:52:36,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:52:36,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:52:36,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:52:36,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:52:36,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-09 01:52:37,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:52:37,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:52:37,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:52:37,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:52:37,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:52:37,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:52:38,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:52:38,540 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:52:38,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:52:38,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448876232/7a67914d55dc4ba39ce97e0198008ea8/FLAG004c4ace9 [2024-11-09 01:52:38,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448876232/7a67914d55dc4ba39ce97e0198008ea8 [2024-11-09 01:52:38,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:52:38,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:52:38,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:38,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:52:38,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:52:38,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:38" (1/1) ... [2024-11-09 01:52:38,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f494047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:38, skipping insertion in model container [2024-11-09 01:52:38,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:38" (1/1) ... [2024-11-09 01:52:38,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:52:39,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-09 01:52:39,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:39,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:52:39,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-09 01:52:39,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:39,226 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:52:39,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39 WrapperNode [2024-11-09 01:52:39,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:39,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:39,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:52:39,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:52:39,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,285 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-09 01:52:39,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:39,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:52:39,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:52:39,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:52:39,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,341 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:52:39,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:52:39,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:52:39,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:52:39,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:52:39,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (1/1) ... [2024-11-09 01:52:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:39,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:52:39,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:52:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:52:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:52:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:52:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:52:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:52:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:52:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 01:52:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:52:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:52:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:52:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-09 01:52:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:52:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:52:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:52:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:52:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 01:52:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 01:52:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:52:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:52:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:52:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:52:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-09 01:52:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-09 01:52:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:52:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:52:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-09 01:52:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:52:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:52:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:52:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:52:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:52:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:52:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:52:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 01:52:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 01:52:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 01:52:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 01:52:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:52:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:52:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:52:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:52:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:52:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:52:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:52:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-09 01:52:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-09 01:52:39,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:52:39,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:52:49,796 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-09 01:52:49,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:52:49,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:52:49,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:52:49,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:49 BoogieIcfgContainer [2024-11-09 01:52:49,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:52:49,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:52:49,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:52:49,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:52:49,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:52:38" (1/3) ... [2024-11-09 01:52:49,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff5e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:49, skipping insertion in model container [2024-11-09 01:52:49,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:39" (2/3) ... [2024-11-09 01:52:49,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff5e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:49, skipping insertion in model container [2024-11-09 01:52:49,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:49" (3/3) ... [2024-11-09 01:52:49,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-09 01:52:49,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:52:49,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:52:49,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:52:49,888 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1e060e80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:52:49,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:52:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:49,900 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:49,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:49,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1790010152, now seen corresponding path program 1 times [2024-11-09 01:52:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809771636] [2024-11-09 01:52:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:49,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:49,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:49,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:52:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:50,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:52:50,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-09 01:52:50,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:50,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809771636] [2024-11-09 01:52:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809771636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:52:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900431932] [2024-11-09 01:52:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:50,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:52:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:52:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:50,567 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:50,603 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-09 01:52:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:52:50,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-09 01:52:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:50,613 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:52:50,614 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:52:50,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:50,619 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:50,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:52:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 01:52:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-09 01:52:50,649 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-09 01:52:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:50,649 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-09 01:52:50,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-09 01:52:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:50,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:50,652 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:50,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:52:50,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:50,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:50,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1285386362, now seen corresponding path program 1 times [2024-11-09 01:52:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308040375] [2024-11-09 01:52:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:50,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:50,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:50,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:50,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:52:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:51,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:52:51,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 01:52:51,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:51,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308040375] [2024-11-09 01:52:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308040375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:51,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:51,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:51,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940949056] [2024-11-09 01:52:51,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:51,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:51,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:51,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:51,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:51,530 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:51,660 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-11-09 01:52:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:51,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-09 01:52:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:51,665 INFO L225 Difference]: With dead ends: 211 [2024-11-09 01:52:51,665 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:52:51,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:51,666 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:51,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:52:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:52:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:52:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-09 01:52:51,685 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-09 01:52:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:51,688 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-09 01:52:51,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:52:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-09 01:52:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:52:51,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:51,691 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:51,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:52:51,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:51,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:51,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 398163516, now seen corresponding path program 1 times [2024-11-09 01:52:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415828872] [2024-11-09 01:52:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:51,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:51,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:51,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:52:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:52,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:52:52,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:52,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:52:55,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-09 01:52:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 01:52:55,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:52:58,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:52:58,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2024-11-09 01:52:59,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415828872] [2024-11-09 01:52:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415828872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:52:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871780208] [2024-11-09 01:52:59,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:59,718 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:52:59,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:52:59,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:52:59,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 01:53:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:00,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:53:00,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:53:00,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:00,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [871780208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:00,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:00,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 01:53:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142900481] [2024-11-09 01:53:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:00,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:53:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:53:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:53:00,640 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:53:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:00,745 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2024-11-09 01:53:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:53:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-09 01:53:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:00,748 INFO L225 Difference]: With dead ends: 218 [2024-11-09 01:53:00,748 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:53:00,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:53:00,750 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:00,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:53:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:53:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 01:53:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:53:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-09 01:53:00,756 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 130 [2024-11-09 01:53:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:00,757 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-09 01:53:00,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:53:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-09 01:53:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:53:00,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:00,759 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:00,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:53:00,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:53:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:53:01,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 400010558, now seen corresponding path program 1 times [2024-11-09 01:53:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725457118] [2024-11-09 01:53:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:01,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:01,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:53:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:01,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:53:01,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:01,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:53:04,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-09 01:53:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 01:53:04,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:07,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:53:07,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2024-11-09 01:53:08,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725457118] [2024-11-09 01:53:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725457118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:53:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980619058] [2024-11-09 01:53:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:53:08,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:53:08,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:53:08,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 01:53:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:09,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:53:09,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:09,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:53:10,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:53:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:53:11,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980619058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-09 01:53:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409383921] [2024-11-09 01:53:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:53:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:53:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:53:11,117 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)