./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.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-a_file-24.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 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:28:43,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:28:43,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:28:43,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:28:43,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:28:43,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:28:43,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:28:43,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:28:43,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:28:43,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:28:43,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:28:43,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:28:43,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:28:43,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:28:43,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:28:43,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:28:43,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:28:43,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:28:43,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:28:43,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:28:43,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:28:43,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:28:43,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:28:43,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:28:43,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:28:43,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:28:43,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:28:43,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:28:43,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:28:43,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:28:43,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:28:43,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:28:43,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:43,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:28:43,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:28:43,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:28:43,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:28:43,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:28:43,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:28:43,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:28:43,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:28:43,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:28:43,146 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 -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2024-11-09 01:28:43,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:28:43,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:28:43,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:28:43,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:28:43,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:28:43,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:28:44,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:28:44,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:28:44,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:28:44,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ecaa958/9369e939c8af4f48b25fb157d06635f6/FLAG29f661b65 [2024-11-09 01:28:45,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ecaa958/9369e939c8af4f48b25fb157d06635f6 [2024-11-09 01:28:45,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:28:45,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:28:45,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:45,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:28:45,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:28:45,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5de448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45, skipping insertion in model container [2024-11-09 01:28:45,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:28:45,524 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-a_file-24.i[916,929] [2024-11-09 01:28:45,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:45,611 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:28:45,621 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-a_file-24.i[916,929] [2024-11-09 01:28:45,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:45,669 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:28:45,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45 WrapperNode [2024-11-09 01:28:45,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:45,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:45,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:28:45,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:28:45,677 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:28:45" (1/1) ... [2024-11-09 01:28:45,693 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:28:45" (1/1) ... [2024-11-09 01:28:45,723 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2024-11-09 01:28:45,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:45,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:28:45,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:28:45,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:28:45,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,758 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-11-09 01:28:45,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:28:45,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:28:45,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:28:45,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:28:45,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (1/1) ... [2024-11-09 01:28:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:45,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:45,857 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:28:45,859 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:28:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:28:45,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:28:45,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:28:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:28:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:28:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:28:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:28:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:28:45,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:28:46,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:28:46,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:28:46,379 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-09 01:28:46,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:28:46,394 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:28:46,395 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:28:46,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:46 BoogieIcfgContainer [2024-11-09 01:28:46,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:28:46,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:28:46,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:28:46,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:28:46,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:28:45" (1/3) ... [2024-11-09 01:28:46,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57b380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:46, skipping insertion in model container [2024-11-09 01:28:46,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:45" (2/3) ... [2024-11-09 01:28:46,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57b380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:46, skipping insertion in model container [2024-11-09 01:28:46,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:46" (3/3) ... [2024-11-09 01:28:46,403 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:28:46,416 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:28:46,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:28:46,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:28:46,472 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;@77e568c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:28:46,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:28:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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:28:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:46,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:46,487 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] [2024-11-09 01:28:46,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:46,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1229634641, now seen corresponding path program 1 times [2024-11-09 01:28:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:46,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325059354] [2024-11-09 01:28:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,053 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:28:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325059354] [2024-11-09 01:28:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325059354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:28:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839624317] [2024-11-09 01:28:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:47,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:28:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:28:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:28:47,112 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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:28:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:47,155 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-09 01:28:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:28:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:47,178 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:28:47,178 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:28:47,185 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:28:47,191 INFO L432 NwaCegarLoop]: 139 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, 139 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:28:47,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:28:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:28:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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:28:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-09 01:28:47,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-09 01:28:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:47,252 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-09 01:28:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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:28:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-09 01:28:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:47,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:47,256 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] [2024-11-09 01:28:47,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:28:47,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1841919127, now seen corresponding path program 1 times [2024-11-09 01:28:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180454121] [2024-11-09 01:28:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,617 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:28:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180454121] [2024-11-09 01:28:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180454121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:28:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047828208] [2024-11-09 01:28:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:28:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:28:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:47,624 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:28:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:47,655 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-09 01:28:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:28:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:47,657 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:28:47,660 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:28:47,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:47,661 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:47,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:28:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:28:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 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:28:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 01:28:47,681 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-09 01:28:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:47,682 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 01:28:47,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:28:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 01:28:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:47,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:47,686 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] [2024-11-09 01:28:47,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:28:47,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:47,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 647609835, now seen corresponding path program 1 times [2024-11-09 01:28:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588479451] [2024-11-09 01:28:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:47,910 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:28:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588479451] [2024-11-09 01:28:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588479451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:28:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368331089] [2024-11-09 01:28:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:28:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:28:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:47,917 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:28:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:47,943 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-09 01:28:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:28:47,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:47,944 INFO L225 Difference]: With dead ends: 194 [2024-11-09 01:28:47,944 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:28:47,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:47,946 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:47,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:28:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 01:28:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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:28:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-09 01:28:47,966 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-09 01:28:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:47,967 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-09 01:28:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:28:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-09 01:28:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:47,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:47,969 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] [2024-11-09 01:28:47,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:28:47,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:47,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -373458519, now seen corresponding path program 1 times [2024-11-09 01:28:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167607990] [2024-11-09 01:28:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,189 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:28:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167607990] [2024-11-09 01:28:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167607990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112794330] [2024-11-09 01:28:48,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:48,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:48,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:48,193 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:48,228 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-09 01:28:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:48,230 INFO L225 Difference]: With dead ends: 198 [2024-11-09 01:28:48,230 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 01:28:48,231 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:28:48,232 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:48,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 01:28:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-09 01:28:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 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:28:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-09 01:28:48,251 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-09 01:28:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:48,252 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-09 01:28:48,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-09 01:28:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:48,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:48,255 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] [2024-11-09 01:28:48,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:28:48,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:48,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 306599851, now seen corresponding path program 1 times [2024-11-09 01:28:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323427937] [2024-11-09 01:28:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,404 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:28:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323427937] [2024-11-09 01:28:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323427937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197048595] [2024-11-09 01:28:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:48,407 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:48,426 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-09 01:28:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:48,427 INFO L225 Difference]: With dead ends: 202 [2024-11-09 01:28:48,427 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 01:28:48,428 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:28:48,429 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:48,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 01:28:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-09 01:28:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 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:28:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-09 01:28:48,434 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-09 01:28:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:48,435 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-09 01:28:48,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-09 01:28:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:48,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:48,436 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] [2024-11-09 01:28:48,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:28:48,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2081607213, now seen corresponding path program 1 times [2024-11-09 01:28:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870877585] [2024-11-09 01:28:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,549 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:28:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870877585] [2024-11-09 01:28:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870877585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:48,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627022891] [2024-11-09 01:28:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:48,552 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:48,569 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-09 01:28:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:48,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:48,570 INFO L225 Difference]: With dead ends: 206 [2024-11-09 01:28:48,570 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:28:48,571 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:28:48,571 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:48,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:28:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-09 01:28:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 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:28:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-09 01:28:48,577 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-09 01:28:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:48,578 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-09 01:28:48,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:28:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-09 01:28:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:28:48,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:48,579 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] [2024-11-09 01:28:48,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:28:48,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:48,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2083454255, now seen corresponding path program 1 times [2024-11-09 01:28:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:48,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086317222] [2024-11-09 01:28:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:48,886 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:28:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086317222] [2024-11-09 01:28:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086317222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:48,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356922314] [2024-11-09 01:28:48,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:48,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:48,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:48,889 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:28:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:49,036 INFO L93 Difference]: Finished difference Result 290 states and 406 transitions. [2024-11-09 01:28:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:49,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-11-09 01:28:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:49,039 INFO L225 Difference]: With dead ends: 290 [2024-11-09 01:28:49,039 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 01:28:49,040 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:28:49,041 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 98 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:49,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 640 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 01:28:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-09 01:28:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 157 states have internal predecessors, (207), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2024-11-09 01:28:49,060 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 124 [2024-11-09 01:28:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:49,060 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2024-11-09 01:28:49,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:28:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2024-11-09 01:28:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:28:49,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:49,063 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] [2024-11-09 01:28:49,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:28:49,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:49,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 169548494, now seen corresponding path program 1 times [2024-11-09 01:28:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:49,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235196702] [2024-11-09 01:28:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:49,633 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:28:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235196702] [2024-11-09 01:28:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235196702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:49,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372878299] [2024-11-09 01:28:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:49,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:49,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:49,637 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:28:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:49,833 INFO L93 Difference]: Finished difference Result 646 states and 907 transitions. [2024-11-09 01:28:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:28:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 125 [2024-11-09 01:28:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:49,837 INFO L225 Difference]: With dead ends: 646 [2024-11-09 01:28:49,837 INFO L226 Difference]: Without dead ends: 464 [2024-11-09 01:28:49,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:28:49,839 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 262 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:49,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 740 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-09 01:28:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 203. [2024-11-09 01:28:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 174 states have (on average 1.339080459770115) internal successors, (233), 175 states have internal predecessors, (233), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2024-11-09 01:28:49,851 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 125 [2024-11-09 01:28:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:49,852 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2024-11-09 01:28:49,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:28:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2024-11-09 01:28:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:28:49,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:49,853 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] [2024-11-09 01:28:49,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:28:49,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 35534988, now seen corresponding path program 1 times [2024-11-09 01:28:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586598616] [2024-11-09 01:28:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,269 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:28:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586598616] [2024-11-09 01:28:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586598616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:50,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874168645] [2024-11-09 01:28:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:50,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:50,272 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:28:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:50,479 INFO L93 Difference]: Finished difference Result 664 states and 932 transitions. [2024-11-09 01:28:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 125 [2024-11-09 01:28:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:50,482 INFO L225 Difference]: With dead ends: 664 [2024-11-09 01:28:50,482 INFO L226 Difference]: Without dead ends: 464 [2024-11-09 01:28:50,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:28:50,485 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 444 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:50,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 613 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-09 01:28:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 205. [2024-11-09 01:28:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 177 states have internal predecessors, (236), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 288 transitions. [2024-11-09 01:28:50,504 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 288 transitions. Word has length 125 [2024-11-09 01:28:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 288 transitions. [2024-11-09 01:28:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:28:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 288 transitions. [2024-11-09 01:28:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:28:50,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:50,507 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] [2024-11-09 01:28:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:28:50,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:50,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 107508880, now seen corresponding path program 1 times [2024-11-09 01:28:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321133824] [2024-11-09 01:28:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:50,795 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:28:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321133824] [2024-11-09 01:28:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321133824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792797483] [2024-11-09 01:28:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:50,798 INFO L87 Difference]: Start difference. First operand 205 states and 288 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:50,925 INFO L93 Difference]: Finished difference Result 504 states and 709 transitions. [2024-11-09 01:28:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:50,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 125 [2024-11-09 01:28:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:50,927 INFO L225 Difference]: With dead ends: 504 [2024-11-09 01:28:50,928 INFO L226 Difference]: Without dead ends: 302 [2024-11-09 01:28:50,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:50,929 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 208 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:50,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 587 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-09 01:28:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 204. [2024-11-09 01:28:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 176 states have internal predecessors, (235), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2024-11-09 01:28:50,938 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 125 [2024-11-09 01:28:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:50,939 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2024-11-09 01:28:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2024-11-09 01:28:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:28:50,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:50,940 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] [2024-11-09 01:28:50,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:28:50,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -26504626, now seen corresponding path program 1 times [2024-11-09 01:28:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345437337] [2024-11-09 01:28:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:51,270 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:28:51,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:51,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345437337] [2024-11-09 01:28:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345437337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:51,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565742751] [2024-11-09 01:28:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:51,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:51,277 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:51,401 INFO L93 Difference]: Finished difference Result 487 states and 684 transitions. [2024-11-09 01:28:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 125 [2024-11-09 01:28:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:51,407 INFO L225 Difference]: With dead ends: 487 [2024-11-09 01:28:51,409 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 01:28:51,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:51,410 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 130 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:51,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 490 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 01:28:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 200. [2024-11-09 01:28:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 172 states have internal predecessors, (228), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2024-11-09 01:28:51,429 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 125 [2024-11-09 01:28:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:51,433 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2024-11-09 01:28:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:28:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2024-11-09 01:28:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:28:51,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:51,435 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] [2024-11-09 01:28:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:28:51,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -885638388, now seen corresponding path program 1 times [2024-11-09 01:28:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619571216] [2024-11-09 01:28:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,141 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:28:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619571216] [2024-11-09 01:28:52,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619571216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:52,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547015370] [2024-11-09 01:28:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:52,143 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:28:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:52,472 INFO L93 Difference]: Finished difference Result 674 states and 945 transitions. [2024-11-09 01:28:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 126 [2024-11-09 01:28:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:52,475 INFO L225 Difference]: With dead ends: 674 [2024-11-09 01:28:52,475 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 01:28:52,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:28:52,476 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 333 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:52,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 653 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:28:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 01:28:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 226. [2024-11-09 01:28:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.3451776649746192) internal successors, (265), 198 states have internal predecessors, (265), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2024-11-09 01:28:52,485 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 126 [2024-11-09 01:28:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:52,486 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2024-11-09 01:28:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:28:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2024-11-09 01:28:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:28:52,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:52,487 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] [2024-11-09 01:28:52,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:28:52,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:52,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1415184202, now seen corresponding path program 1 times [2024-11-09 01:28:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049622503] [2024-11-09 01:28:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:52,835 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:28:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049622503] [2024-11-09 01:28:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049622503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934051683] [2024-11-09 01:28:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:52,837 INFO L87 Difference]: Start difference. First operand 226 states and 317 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:28:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:53,174 INFO L93 Difference]: Finished difference Result 700 states and 980 transitions. [2024-11-09 01:28:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 126 [2024-11-09 01:28:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:53,177 INFO L225 Difference]: With dead ends: 700 [2024-11-09 01:28:53,177 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 01:28:53,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:28:53,178 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 248 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:53,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 846 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:28:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 01:28:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 230. [2024-11-09 01:28:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 201 states have (on average 1.3482587064676617) internal successors, (271), 202 states have internal predecessors, (271), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 323 transitions. [2024-11-09 01:28:53,207 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 323 transitions. Word has length 126 [2024-11-09 01:28:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:53,207 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 323 transitions. [2024-11-09 01:28:53,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:28:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 323 transitions. [2024-11-09 01:28:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:28:53,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:53,212 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] [2024-11-09 01:28:53,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:28:53,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1486100874, now seen corresponding path program 1 times [2024-11-09 01:28:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420345445] [2024-11-09 01:28:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,694 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:28:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:53,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420345445] [2024-11-09 01:28:53,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420345445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:53,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:53,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88332697] [2024-11-09 01:28:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:53,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:53,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:53,696 INFO L87 Difference]: Start difference. First operand 230 states and 323 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:28:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:53,764 INFO L93 Difference]: Finished difference Result 537 states and 754 transitions. [2024-11-09 01:28:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 126 [2024-11-09 01:28:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:53,766 INFO L225 Difference]: With dead ends: 537 [2024-11-09 01:28:53,766 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 01:28:53,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:53,767 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 124 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:53,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 488 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 01:28:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 229. [2024-11-09 01:28:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 200 states have (on average 1.34) internal successors, (268), 201 states have internal predecessors, (268), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 320 transitions. [2024-11-09 01:28:53,777 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 320 transitions. Word has length 126 [2024-11-09 01:28:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:53,777 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 320 transitions. [2024-11-09 01:28:53,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:28:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 320 transitions. [2024-11-09 01:28:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:28:53,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:53,778 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] [2024-11-09 01:28:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:28:53,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -508043832, now seen corresponding path program 1 times [2024-11-09 01:28:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953636382] [2024-11-09 01:28:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:53,969 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:28:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953636382] [2024-11-09 01:28:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953636382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280885220] [2024-11-09 01:28:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:53,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:53,971 INFO L87 Difference]: Start difference. First operand 229 states and 320 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:28:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:54,049 INFO L93 Difference]: Finished difference Result 536 states and 749 transitions. [2024-11-09 01:28:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 126 [2024-11-09 01:28:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:54,051 INFO L225 Difference]: With dead ends: 536 [2024-11-09 01:28:54,051 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 01:28:54,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:54,052 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 121 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:54,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 533 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 01:28:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 200. [2024-11-09 01:28:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 172 states have internal predecessors, (225), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 277 transitions. [2024-11-09 01:28:54,064 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 277 transitions. Word has length 126 [2024-11-09 01:28:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:54,065 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 277 transitions. [2024-11-09 01:28:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:28:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 277 transitions. [2024-11-09 01:28:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 01:28:54,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:54,066 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] [2024-11-09 01:28:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:28:54,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1903072021, now seen corresponding path program 1 times [2024-11-09 01:28:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939762149] [2024-11-09 01:28:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,556 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:28:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939762149] [2024-11-09 01:28:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939762149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383975415] [2024-11-09 01:28:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:54,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:54,563 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:28:54,566 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:28:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:28:54,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:55,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 17 [2024-11-09 01:28:55,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 50 [2024-11-09 01:28:55,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 64 [2024-11-09 01:28:55,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 01:28:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 114 proven. 36 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-09 01:28:55,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:55,513 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:28:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383975415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:55,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 01:28:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686798352] [2024-11-09 01:28:55,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:55,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:28:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:28:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:28:55,516 INFO L87 Difference]: Start difference. First operand 200 states and 277 transitions. Second operand has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-09 01:28:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:55,935 INFO L93 Difference]: Finished difference Result 600 states and 819 transitions. [2024-11-09 01:28:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:28:55,936 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 127 [2024-11-09 01:28:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:55,938 INFO L225 Difference]: With dead ends: 600 [2024-11-09 01:28:55,938 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 01:28:55,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:28:55,939 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 870 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:55,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 755 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:28:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 01:28:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 210. [2024-11-09 01:28:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 180 states have internal predecessors, (233), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:28:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 285 transitions. [2024-11-09 01:28:55,951 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 285 transitions. Word has length 127 [2024-11-09 01:28:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:55,952 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 285 transitions. [2024-11-09 01:28:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-09 01:28:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 285 transitions. [2024-11-09 01:28:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 01:28:55,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:55,953 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] [2024-11-09 01:28:55,969 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:28:56,154 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,SelfDestructingSolverStorable15 [2024-11-09 01:28:56,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1393598931, now seen corresponding path program 1 times [2024-11-09 01:28:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124008285] [2024-11-09 01:28:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,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:28:57,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124008285] [2024-11-09 01:28:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124008285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:57,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:28:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612014042] [2024-11-09 01:28:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:57,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:57,184 INFO L87 Difference]: Start difference. First operand 210 states and 285 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 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:28:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:57,457 INFO L93 Difference]: Finished difference Result 500 states and 677 transitions. [2024-11-09 01:28:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:57,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 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 127 [2024-11-09 01:28:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:57,460 INFO L225 Difference]: With dead ends: 500 [2024-11-09 01:28:57,460 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 01:28:57,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:57,461 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 91 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:57,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1071 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 01:28:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-11-09 01:28:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 250 states have internal predecessors, (322), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:28:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 392 transitions. [2024-11-09 01:28:57,479 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 392 transitions. Word has length 127 [2024-11-09 01:28:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:57,479 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 392 transitions. [2024-11-09 01:28:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 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:28:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 392 transitions. [2024-11-09 01:28:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:28:57,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:57,481 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] [2024-11-09 01:28:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:28:57,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -453626276, now seen corresponding path program 1 times [2024-11-09 01:28:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492436145] [2024-11-09 01:28:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:28:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:28:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:28:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:28:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:28:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:57,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:28:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492436145] [2024-11-09 01:28:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492436145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704496765] [2024-11-09 01:28:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:57,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:57,648 INFO L87 Difference]: Start difference. First operand 290 states and 392 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:28:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:57,681 INFO L93 Difference]: Finished difference Result 586 states and 793 transitions. [2024-11-09 01:28:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 128 [2024-11-09 01:28:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:57,683 INFO L225 Difference]: With dead ends: 586 [2024-11-09 01:28:57,683 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 01:28:57,684 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:28:57,684 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:57,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 01:28:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-11-09 01:28:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 257 states have (on average 1.2879377431906616) internal successors, (331), 259 states have internal predecessors, (331), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 01:28:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 401 transitions. [2024-11-09 01:28:57,703 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 401 transitions. Word has length 128 [2024-11-09 01:28:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 401 transitions. [2024-11-09 01:28:57,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:28:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 401 transitions. [2024-11-09 01:28:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:28:57,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:57,706 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] [2024-11-09 01:28:57,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:28:57,706 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 443802692, now seen corresponding path program 1 times [2024-11-09 01:28:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104653796] [2024-11-09 01:28:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:28:57,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:28:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:28:57,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:28:57,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:28:57,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:28:57,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:28:57,881 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] [2024-11-09 01:28:57,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:28:57,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:28:57 BoogieIcfgContainer [2024-11-09 01:28:57,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:28:57,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:28:57,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:28:57,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:28:57,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:46" (3/4) ... [2024-11-09 01:28:57,982 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:28:57,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:28:57,983 INFO L158 Benchmark]: Toolchain (without parser) took 12669.19ms. Allocated memory was 199.2MB in the beginning and 461.4MB in the end (delta: 262.1MB). Free memory was 170.0MB in the beginning and 335.1MB in the end (delta: -165.0MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,984 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:57,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 199.2MB. Free memory was 169.8MB in the beginning and 156.5MB in the end (delta: 13.4MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 199.2MB. Free memory was 156.5MB in the beginning and 153.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,985 INFO L158 Benchmark]: Boogie Preprocessor took 81.07ms. Allocated memory is still 199.2MB. Free memory was 153.2MB in the beginning and 148.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,985 INFO L158 Benchmark]: RCFGBuilder took 589.51ms. Allocated memory is still 199.2MB. Free memory was 148.1MB in the beginning and 114.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,985 INFO L158 Benchmark]: TraceAbstraction took 11581.37ms. Allocated memory was 199.2MB in the beginning and 461.4MB in the end (delta: 262.1MB). Free memory was 113.6MB in the beginning and 335.1MB in the end (delta: -221.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-11-09 01:28:57,985 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 461.4MB. Free memory is still 335.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:57,987 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.16ms. Allocated memory is still 134.2MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 199.2MB. Free memory was 169.8MB in the beginning and 156.5MB in the end (delta: 13.4MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 199.2MB. Free memory was 156.5MB in the beginning and 153.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.07ms. Allocated memory is still 199.2MB. Free memory was 153.2MB in the beginning and 148.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 589.51ms. Allocated memory is still 199.2MB. Free memory was 148.1MB in the beginning and 114.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11581.37ms. Allocated memory was 199.2MB in the beginning and 461.4MB in the end (delta: 262.1MB). Free memory was 113.6MB in the beginning and 335.1MB in the end (delta: -221.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 461.4MB. Free memory is still 335.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 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] RET updateVariables() [L98] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][1] [L43] BOOL_unsigned_char_Array_0[0][0] = ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))) [L45] EXPR signed_char_Array_0[2] [L45] unsigned_char_Array_0[0] = signed_char_Array_0[2] [L46] EXPR float_Array_0[1] [L46] float_Array_0[0] = float_Array_0[1] [L47] EXPR signed_char_Array_0[3] [L47] signed_char_Array_0[0] = signed_char_Array_0[3] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L48] EXPR float_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L49] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed_char_Array_0[4] = ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]))) [L57] EXPR float_Array_0[0] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) [L57] EXPR float_Array_0[0] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0][0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L89] EXPR float_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) [L89] EXPR signed_char_Array_0[4] [L89] EXPR signed_char_Array_0[3] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89-L90] return ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2950 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2932 mSDsluCounter, 9817 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7001 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1716 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 2816 mSDtfsCounter, 1716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 837 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1595 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2510 NumberOfCodeBlocks, 2510 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2488 ConstructedInterpolants, 0 QuantifiedInterpolants, 5776 SizeOfPredicates, 3 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 8292/8400 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:28:58,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-a_file-24.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 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:29:00,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:29:00,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:29:00,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:29:00,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:29:00,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:29:00,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:29:00,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:29:00,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:29:00,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:29:00,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:29:00,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:29:00,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:29:00,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:29:00,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:29:00,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:29:00,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:29:00,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:29:00,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:29:00,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:29:00,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:29:00,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:29:00,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:29:00,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:29:00,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:29:00,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:29:00,279 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:29:00,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:29:00,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:29:00,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:29:00,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:29:00,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:29:00,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:29:00,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:29:00,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:29:00,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:29:00,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:29:00,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:29:00,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:29:00,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:00,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:29:00,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:29:00,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:29:00,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:29:00,284 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 -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2024-11-09 01:29:00,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:29:00,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:29:00,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:29:00,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:29:00,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:29:00,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:29:01,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:29:02,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:29:02,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:29:02,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d4a4b7a/afd31a7232314275af9a4d1a9972f1bc/FLAGf7d63807c [2024-11-09 01:29:02,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d4a4b7a/afd31a7232314275af9a4d1a9972f1bc [2024-11-09 01:29:02,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:29:02,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:29:02,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:29:02,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:29:02,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:29:02,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:02,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be016ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02, skipping insertion in model container [2024-11-09 01:29:02,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:02,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:29:02,747 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-a_file-24.i[916,929] [2024-11-09 01:29:02,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:29:02,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:29:02,875 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-a_file-24.i[916,929] [2024-11-09 01:29:02,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:29:02,952 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:29:02,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02 WrapperNode [2024-11-09 01:29:02,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:29:02,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:29:02,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:29:02,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:29:02,960 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:29:02" (1/1) ... [2024-11-09 01:29:02,977 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:29:02" (1/1) ... [2024-11-09 01:29:03,027 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-11-09 01:29:03,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:29:03,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:29:03,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:29:03,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:29:03,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,075 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-11-09 01:29:03,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:29:03,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:29:03,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:29:03,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:29:03,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (1/1) ... [2024-11-09 01:29:03,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:29:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:29:03,158 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:29:03,165 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:29:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:29:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:29:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:29:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:29:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:29:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:29:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:29:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:29:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:29:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:29:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:29:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:29:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:29:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:29:03,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:29:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:29:03,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:29:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:29:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:29:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:29:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:29:03,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:29:03,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:29:21,822 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-09 01:29:21,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:29:21,840 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:29:21,840 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:29:21,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:29:21 BoogieIcfgContainer [2024-11-09 01:29:21,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:29:21,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:29:21,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:29:21,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:29:21,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:29:02" (1/3) ... [2024-11-09 01:29:21,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6507d95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:29:21, skipping insertion in model container [2024-11-09 01:29:21,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:29:02" (2/3) ... [2024-11-09 01:29:21,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6507d95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:29:21, skipping insertion in model container [2024-11-09 01:29:21,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:29:21" (3/3) ... [2024-11-09 01:29:21,847 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2024-11-09 01:29:21,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:29:21,860 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:29:21,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:29:21,912 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;@648b4ca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:29:21,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:29:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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:29:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:21,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:21,926 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] [2024-11-09 01:29:21,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1229634641, now seen corresponding path program 1 times [2024-11-09 01:29:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85529070] [2024-11-09 01:29:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:21,942 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:29:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:21,945 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:29:21,948 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:29:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:22,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:29:22,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 01:29:23,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:23,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85529070] [2024-11-09 01:29:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85529070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:29:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000045149] [2024-11-09 01:29:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:23,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:29:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:29:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:29:23,045 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:29:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:23,084 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-09 01:29:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:29:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 124 [2024-11-09 01:29:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:23,093 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:29:23,094 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:29:23,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:29:23,100 INFO L432 NwaCegarLoop]: 139 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, 139 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:29:23,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:29:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:29:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:29:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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:29:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-09 01:29:23,144 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-09 01:29:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:23,145 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-09 01:29:23,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:29:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-09 01:29:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:23,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:23,149 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] [2024-11-09 01:29:23,178 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:23,350 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:29:23,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1841919127, now seen corresponding path program 1 times [2024-11-09 01:29:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790596260] [2024-11-09 01:29:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:23,354 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:29:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:23,357 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:29:23,359 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:29:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:24,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:29:24,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:24,446 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:29:24,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:24,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790596260] [2024-11-09 01:29:24,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790596260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:24,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:24,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:29:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775626715] [2024-11-09 01:29:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:24,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:29:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:29:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:29:24,449 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:29:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:24,606 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-09 01:29:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:29:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-09 01:29:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:24,611 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:29:24,612 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:29:24,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:29:24,613 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:24,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:29:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:29:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:29:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 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:29:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 01:29:24,631 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-09 01:29:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:24,632 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 01:29:24,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:29:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 01:29:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:24,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:24,636 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] [2024-11-09 01:29:24,663 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:24,836 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:29:24,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:24,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash 647609835, now seen corresponding path program 1 times [2024-11-09 01:29:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211622772] [2024-11-09 01:29:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:24,839 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:29:24,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:24,844 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:29:24,845 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:29:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:25,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:29:25,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:26,828 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:29:26,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:26,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211622772] [2024-11-09 01:29:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211622772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:26,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:29:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881414619] [2024-11-09 01:29:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:29:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:29:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:29:26,835 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:29:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:29,378 INFO L93 Difference]: Finished difference Result 284 states and 408 transitions. [2024-11-09 01:29:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:29:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-11-09 01:29:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:29,381 INFO L225 Difference]: With dead ends: 284 [2024-11-09 01:29:29,381 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 01:29:29,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:29:29,383 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:29,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 476 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 01:29:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 01:29:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2024-11-09 01:29:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 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:29:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-09 01:29:29,399 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 124 [2024-11-09 01:29:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:29,403 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-09 01:29:29,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:29:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-09 01:29:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:29,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:29,404 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] [2024-11-09 01:29:29,442 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:29,605 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 [2024-11-09 01:29:29,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:29,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -373458519, now seen corresponding path program 1 times [2024-11-09 01:29:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:29,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407555483] [2024-11-09 01:29:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:29,608 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:29:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:29,610 INFO L229 MonitoredProcess]: Starting monitored process 5 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:29:29,611 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 (5)] Waiting until timeout for monitored process [2024-11-09 01:29:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:30,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:29:30,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:31,099 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:29:31,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:31,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407555483] [2024-11-09 01:29:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407555483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:29:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693982423] [2024-11-09 01:29:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:29:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:29:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:29:31,101 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:29:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:31,813 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-09 01:29:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:29:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-11-09 01:29:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:31,817 INFO L225 Difference]: With dead ends: 228 [2024-11-09 01:29:31,818 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:29:31,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:29:31,822 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:31,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:29:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:29:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-09 01:29:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 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:29:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-09 01:29:31,854 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 124 [2024-11-09 01:29:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:31,854 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-09 01:29:31,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:29:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-09 01:29:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:31,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:31,856 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] [2024-11-09 01:29:31,895 INFO L540 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:32,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:29:32,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:32,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash 306599851, now seen corresponding path program 1 times [2024-11-09 01:29:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396738184] [2024-11-09 01:29:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:32,072 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:29:32,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:32,079 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:29:32,083 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:29:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:33,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:29:33,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:33,869 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:29:33,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:33,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396738184] [2024-11-09 01:29:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396738184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:33,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:33,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:29:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833212328] [2024-11-09 01:29:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:33,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:29:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:29:33,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:29:33,875 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:29:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:34,935 INFO L93 Difference]: Finished difference Result 234 states and 333 transitions. [2024-11-09 01:29:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:29:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 124 [2024-11-09 01:29:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:34,938 INFO L225 Difference]: With dead ends: 234 [2024-11-09 01:29:34,938 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 01:29:34,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:29:34,940 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:34,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:29:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 01:29:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-09 01:29:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 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:29:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2024-11-09 01:29:34,952 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 124 [2024-11-09 01:29:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:34,955 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2024-11-09 01:29:34,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:29:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2024-11-09 01:29:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:34,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:34,956 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] [2024-11-09 01:29:34,984 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 (6)] Ended with exit code 0 [2024-11-09 01:29:35,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:29:35,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2081607213, now seen corresponding path program 1 times [2024-11-09 01:29:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896453352] [2024-11-09 01:29:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:35,159 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:29:35,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:35,161 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29:35,164 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 (7)] Waiting until timeout for monitored process [2024-11-09 01:29:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:36,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:29:36,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:37,245 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:29:37,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:37,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896453352] [2024-11-09 01:29:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896453352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:29:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681277268] [2024-11-09 01:29:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:29:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:29:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:29:37,253 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:29:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:38,723 INFO L93 Difference]: Finished difference Result 238 states and 337 transitions. [2024-11-09 01:29:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:29:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 124 [2024-11-09 01:29:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:38,725 INFO L225 Difference]: With dead ends: 238 [2024-11-09 01:29:38,725 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:29:38,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:29:38,726 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:38,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 01:29:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:29:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-09 01:29:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 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:29:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-11-09 01:29:38,747 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 124 [2024-11-09 01:29:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:38,748 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-11-09 01:29:38,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:29:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-11-09 01:29:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:29:38,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:38,749 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] [2024-11-09 01:29:38,778 INFO L540 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:29:38,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2083454255, now seen corresponding path program 1 times [2024-11-09 01:29:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315728626] [2024-11-09 01:29:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:38,951 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:29:38,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:38,953 INFO L229 MonitoredProcess]: Starting monitored process 8 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:29:38,954 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 (8)] Waiting until timeout for monitored process [2024-11-09 01:29:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:40,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:29:40,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:51,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2024-11-09 01:29:52,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:52,801 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 148 treesize of output 58 [2024-11-09 01:30:05,869 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:30:14,068 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)