./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.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-91.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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:36:41,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:36:42,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:36:42,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:36:42,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:36:42,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:36:42,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:36:42,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:36:42,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:36:42,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:36:42,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:36:42,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:36:42,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:36:42,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:36:42,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:36:42,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:36:42,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:36:42,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:36:42,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:36:42,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:36:42,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:36:42,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:36:42,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:36:42,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:36:42,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:36:42,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:36:42,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:36:42,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:36:42,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:36:42,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:36:42,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:36:42,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:36:42,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:42,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:36:42,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:36:42,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:36:42,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:36:42,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:36:42,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:36:42,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:36:42,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:36:42,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:36:42,099 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-09 01:36:42,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:36:42,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:36:42,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:36:42,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:36:42,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:36:42,399 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-91.i [2024-11-09 01:36:43,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:36:44,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:36:44,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-09 01:36:44,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c993ca78/ee1ecfcd0a6e45d1aba6963b52317d36/FLAGaadd72f63 [2024-11-09 01:36:44,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c993ca78/ee1ecfcd0a6e45d1aba6963b52317d36 [2024-11-09 01:36:44,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:36:44,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:36:44,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:44,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:36:44,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:36:44,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840221a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44, skipping insertion in model container [2024-11-09 01:36:44,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:36:44,655 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-91.i[916,929] [2024-11-09 01:36:44,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:44,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:36:44,744 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-91.i[916,929] [2024-11-09 01:36:44,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:44,835 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:36:44,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44 WrapperNode [2024-11-09 01:36:44,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:44,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:44,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:36:44,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:36:44,849 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:36:44" (1/1) ... [2024-11-09 01:36:44,868 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:36:44" (1/1) ... [2024-11-09 01:36:44,906 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 582 [2024-11-09 01:36:44,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:44,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:36:44,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:36:44,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:36:44,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,956 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-09 01:36:44,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:44,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:36:44,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:36:44,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:36:44,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:36:45,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (1/1) ... [2024-11-09 01:36:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:45,039 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:36:45,062 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:36:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:36:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:36:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:36:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:36:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:36:45,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:36:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:36:45,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:36:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:36:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:36:45,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:36:45,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:36:45,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:36:45,856 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-09 01:36:45,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:36:45,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:36:45,876 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:36:45,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:45 BoogieIcfgContainer [2024-11-09 01:36:45,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:36:45,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:36:45,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:36:45,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:36:45,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:36:44" (1/3) ... [2024-11-09 01:36:45,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11138c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:45, skipping insertion in model container [2024-11-09 01:36:45,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:44" (2/3) ... [2024-11-09 01:36:45,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11138c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:45, skipping insertion in model container [2024-11-09 01:36:45,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:45" (3/3) ... [2024-11-09 01:36:45,886 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-09 01:36:45,902 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:36:45,902 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:36:45,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:36:45,966 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;@513a59ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:36:45,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:36:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:36:45,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:45,986 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:45,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1430690379, now seen corresponding path program 1 times [2024-11-09 01:36:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895894809] [2024-11-09 01:36:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:36:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:36:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:36:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:36:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:36:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:36:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:36:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:36:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:36:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:36:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:36:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:36:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:36:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:36:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:36:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:36:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:36:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:36:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895894809] [2024-11-09 01:36:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895894809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:36:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172581946] [2024-11-09 01:36:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:36:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:36:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:36:46,471 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:46,504 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-09 01:36:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:36:46,508 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-09 01:36:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:46,518 INFO L225 Difference]: With dead ends: 243 [2024-11-09 01:36:46,518 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 01:36:46,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:36:46,526 INFO L432 NwaCegarLoop]: 177 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, 177 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:36:46,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 01:36:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 01:36:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-09 01:36:46,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-09 01:36:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:46,587 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-09 01:36:46,588 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-09 01:36:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:36:46,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:46,591 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:36:46,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1147655401, now seen corresponding path program 1 times [2024-11-09 01:36:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:46,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813750811] [2024-11-09 01:36:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:36:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:36:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:36:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:36:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:36:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:36:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:36:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:36:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:36:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:36:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:36:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:36:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:36:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:36:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:36:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:36:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:36:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:36:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813750811] [2024-11-09 01:36:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813750811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:36:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813475454] [2024-11-09 01:36:47,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:47,130 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:47,187 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-09 01:36:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:47,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-09 01:36:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:47,191 INFO L225 Difference]: With dead ends: 241 [2024-11-09 01:36:47,191 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 01:36:47,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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:36:47,195 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:47,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 01:36:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 01:36:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-09 01:36:47,220 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-09 01:36:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:47,221 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-09 01:36:47,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-09 01:36:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:36:47,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:47,229 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:36:47,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -530064823, now seen corresponding path program 1 times [2024-11-09 01:36:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:47,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643000867] [2024-11-09 01:36:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:36:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:36:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:36:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:36:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:36:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:36:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:36:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:36:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:36:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:36:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:36:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:36:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:36:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:36:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:47,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:36:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:36:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:36:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:36:48,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643000867] [2024-11-09 01:36:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643000867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:48,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403507699] [2024-11-09 01:36:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:48,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:48,018 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:48,219 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2024-11-09 01:36:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-09 01:36:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:48,225 INFO L225 Difference]: With dead ends: 331 [2024-11-09 01:36:48,225 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 01:36:48,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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:36:48,227 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 111 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:48,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1148 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 01:36:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-09 01:36:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 186 states have internal predecessors, (263), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:36:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 303 transitions. [2024-11-09 01:36:48,258 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 303 transitions. Word has length 140 [2024-11-09 01:36:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 303 transitions. [2024-11-09 01:36:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 303 transitions. [2024-11-09 01:36:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:36:48,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:48,265 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:36:48,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash 104451762, now seen corresponding path program 1 times [2024-11-09 01:36:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305402757] [2024-11-09 01:36:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414861789] [2024-11-09 01:36:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:48,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:48,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:48,415 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:36:48,418 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:36:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:36:48,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:36:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:36:49,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:36:49,109 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:36:49,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:36:49,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:49,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:49,316 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 01:36:49,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:36:49,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:36:49 BoogieIcfgContainer [2024-11-09 01:36:49,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:36:49,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:36:49,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:36:49,394 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:36:49,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:45" (3/4) ... [2024-11-09 01:36:49,396 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:36:49,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:36:49,398 INFO L158 Benchmark]: Toolchain (without parser) took 4961.59ms. Allocated memory was 140.5MB in the beginning and 199.2MB in the end (delta: 58.7MB). Free memory was 87.2MB in the beginning and 128.5MB in the end (delta: -41.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,398 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 140.5MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:36:49,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.50ms. Allocated memory is still 140.5MB. Free memory was 87.2MB in the beginning and 68.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.10ms. Allocated memory is still 140.5MB. Free memory was 68.7MB in the beginning and 64.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,399 INFO L158 Benchmark]: Boogie Preprocessor took 88.58ms. Allocated memory is still 140.5MB. Free memory was 64.5MB in the beginning and 59.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,399 INFO L158 Benchmark]: RCFGBuilder took 879.00ms. Allocated memory is still 140.5MB. Free memory was 59.6MB in the beginning and 74.4MB in the end (delta: -14.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,400 INFO L158 Benchmark]: TraceAbstraction took 3514.99ms. Allocated memory was 140.5MB in the beginning and 199.2MB in the end (delta: 58.7MB). Free memory was 73.6MB in the beginning and 129.5MB in the end (delta: -55.9MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-09 01:36:49,401 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 128.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:36:49,402 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.22ms. Allocated memory is still 140.5MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.50ms. Allocated memory is still 140.5MB. Free memory was 87.2MB in the beginning and 68.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.10ms. Allocated memory is still 140.5MB. Free memory was 68.7MB in the beginning and 64.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.58ms. Allocated memory is still 140.5MB. Free memory was 64.5MB in the beginning and 59.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 879.00ms. Allocated memory is still 140.5MB. Free memory was 59.6MB in the beginning and 74.4MB in the end (delta: -14.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3514.99ms. Allocated memory was 140.5MB in the beginning and 199.2MB in the end (delta: 58.7MB). Free memory was 73.6MB in the beginning and 129.5MB in the end (delta: -55.9MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 128.5MB in the end (delta: 1.0MB). 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 95, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; VAL [float_Array_0={4:0}, isInitial=0, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L64] float_Array_0[0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L68] float_Array_0[2] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L70] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L71] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L73] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L76] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L79] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L80] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[0][2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L103] RET updateVariables() [L104] CALL step() [L34] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L34] COND FALSE !(float_Array_0[2] >= 50.4f) [L37] EXPR unsigned_long_int_Array_0[0][2] [L37] EXPR unsigned_long_int_Array_0[1][2] [L37] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L37] COND FALSE !(unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) [L44] EXPR signed_short_int_Array_0[1] [L44] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L46] EXPR unsigned_long_int_Array_0[1][1] [L46] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L46] COND FALSE !(! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] unsigned_long_int_Array_0[0][0] = ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))) [L51] EXPR unsigned_long_int_Array_0[1][0] [L51] EXPR unsigned_long_int_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) [L60] EXPR signed_short_int_Array_0[3] [L60] signed_short_int_Array_0[0] = signed_short_int_Array_0[3] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 [L95] EXPR unsigned_long_int_Array_0[1][2] [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95-L96] return ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1839 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 554 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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:36:49,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:36:51,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:36:51,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:36:51,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:36:51,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:36:51,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:36:51,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:36:51,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:36:51,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:36:51,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:36:51,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:36:51,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:36:51,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:36:51,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:36:51,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:36:51,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:36:51,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:36:51,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:36:51,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:36:51,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:36:51,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:36:51,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:36:51,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:36:51,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:36:51,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:36:51,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:36:51,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:36:51,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:36:51,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:36:51,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:36:51,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:36:51,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:36:51,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:36:51,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:36:51,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:51,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:36:51,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:36:51,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:36:51,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:36:51,798 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:36:51,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:36:51,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:36:51,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:36:51,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:36:51,799 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-09 01:36:52,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:36:52,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:36:52,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:36:52,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:36:52,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:36:52,135 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-91.i [2024-11-09 01:36:53,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:36:53,952 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:36:53,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-09 01:36:53,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b183e0c4/e6fabecb67d449c3b3ec047811870db8/FLAGb06068056 [2024-11-09 01:36:53,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b183e0c4/e6fabecb67d449c3b3ec047811870db8 [2024-11-09 01:36:53,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:36:53,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:36:53,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:53,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:36:53,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:36:53,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:53" (1/1) ... [2024-11-09 01:36:53,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789c3982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:53, skipping insertion in model container [2024-11-09 01:36:53,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:53" (1/1) ... [2024-11-09 01:36:54,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:36:54,213 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-91.i[916,929] [2024-11-09 01:36:54,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:54,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:36:54,354 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-91.i[916,929] [2024-11-09 01:36:54,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:54,432 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:36:54,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54 WrapperNode [2024-11-09 01:36:54,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:54,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:54,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:36:54,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:36:54,440 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:36:54" (1/1) ... [2024-11-09 01:36:54,466 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:36:54" (1/1) ... [2024-11-09 01:36:54,517 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-11-09 01:36:54,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:54,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:36:54,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:36:54,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:36:54,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,584 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-09 01:36:54,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:36:54,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:36:54,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:36:54,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:36:54,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (1/1) ... [2024-11-09 01:36:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:54,672 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:36:54,678 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:36:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:36:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:36:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:36:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:36:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:36:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:36:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:36:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:36:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:36:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:36:54,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:36:54,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:36:56,101 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-09 01:36:56,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:36:56,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:36:56,114 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:36:56,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:56 BoogieIcfgContainer [2024-11-09 01:36:56,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:36:56,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:36:56,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:36:56,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:36:56,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:36:53" (1/3) ... [2024-11-09 01:36:56,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd33126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:56, skipping insertion in model container [2024-11-09 01:36:56,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:54" (2/3) ... [2024-11-09 01:36:56,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd33126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:56, skipping insertion in model container [2024-11-09 01:36:56,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:56" (3/3) ... [2024-11-09 01:36:56,122 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-09 01:36:56,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:36:56,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:36:56,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:36:56,206 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;@2691b1c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:36:56,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:36:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:36:56,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:56,230 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1430690379, now seen corresponding path program 1 times [2024-11-09 01:36:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991318820] [2024-11-09 01:36:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:56,254 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:36:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:56,258 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:36:56,259 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:36:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:56,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:36:56,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 01:36:56,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:56,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991318820] [2024-11-09 01:36:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991318820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:36:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151061359] [2024-11-09 01:36:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:56,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:36:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:36:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:36:56,674 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:56,716 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-09 01:36:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:36:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-09 01:36:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:56,728 INFO L225 Difference]: With dead ends: 243 [2024-11-09 01:36:56,728 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 01:36:56,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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:36:56,737 INFO L432 NwaCegarLoop]: 177 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, 177 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:36:56,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 01:36:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 01:36:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-09 01:36:56,806 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-09 01:36:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:56,807 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-09 01:36:56,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-09 01:36:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:36:56,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:56,810 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:36:57,014 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:36:57,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:57,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1147655401, now seen corresponding path program 1 times [2024-11-09 01:36:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945001332] [2024-11-09 01:36:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:57,018 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:36:57,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:57,043 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:36:57,045 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:36:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:57,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:36:57,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:36:57,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:57,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945001332] [2024-11-09 01:36:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945001332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:36:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208022642] [2024-11-09 01:36:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:57,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:57,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:57,448 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:57,526 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-09 01:36:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-09 01:36:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:57,533 INFO L225 Difference]: With dead ends: 241 [2024-11-09 01:36:57,533 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 01:36:57,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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:36:57,537 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:57,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 01:36:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 01:36:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:36:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-09 01:36:57,551 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-09 01:36:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:57,553 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-09 01:36:57,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:36:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-09 01:36:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:36:57,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:57,556 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:36:57,757 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:36:57,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -530064823, now seen corresponding path program 1 times [2024-11-09 01:36:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:57,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427466065] [2024-11-09 01:36:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:57,761 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:36:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:57,765 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:36:57,766 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:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:58,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:36:58,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:58,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:36:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:36:58,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:36:58,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 34 [2024-11-09 01:36:58,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:58,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2024-11-09 01:36:58,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:58,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 34 [2024-11-09 01:36:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:36:58,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:58,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427466065] [2024-11-09 01:36:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427466065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077598263] [2024-11-09 01:36:58,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:58,773 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:59,819 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2024-11-09 01:36:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-09 01:36:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:59,823 INFO L225 Difference]: With dead ends: 331 [2024-11-09 01:36:59,823 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 01:36:59,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:36:59,825 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 315 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:59,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 880 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:36:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 01:36:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-09 01:36:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 186 states have internal predecessors, (263), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:36:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 303 transitions. [2024-11-09 01:36:59,857 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 303 transitions. Word has length 140 [2024-11-09 01:36:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:59,858 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 303 transitions. [2024-11-09 01:36:59,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:36:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 303 transitions. [2024-11-09 01:36:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:36:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:59,862 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:37:00,062 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:37:00,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 104451762, now seen corresponding path program 1 times [2024-11-09 01:37:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829414365] [2024-11-09 01:37:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:00,065 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:37:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:00,068 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:37:00,069 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:37:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:00,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:37:00,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-09 01:37:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-09 01:37:01,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:01,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829414365] [2024-11-09 01:37:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829414365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:01,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:01,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:37:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216063578] [2024-11-09 01:37:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:37:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:37:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:37:01,373 INFO L87 Difference]: Start difference. First operand 208 states and 303 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:03,241 INFO L93 Difference]: Finished difference Result 604 states and 881 transitions. [2024-11-09 01:37:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:37:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-09 01:37:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:03,246 INFO L225 Difference]: With dead ends: 604 [2024-11-09 01:37:03,247 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 01:37:03,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:37:03,249 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 336 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:03,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 639 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 01:37:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 01:37:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2024-11-09 01:37:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.417142857142857) internal successors, (496), 354 states have internal predecessors, (496), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:37:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2024-11-09 01:37:03,310 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 140 [2024-11-09 01:37:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:03,311 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2024-11-09 01:37:03,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2024-11-09 01:37:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:37:03,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:03,314 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,324 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:37:03,518 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:37:03,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:03,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1617550924, now seen corresponding path program 1 times [2024-11-09 01:37:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690173636] [2024-11-09 01:37:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:03,521 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:37:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:03,525 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:37:03,526 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:37:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:03,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:37:03,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-09 01:37:03,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:03,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:37:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690173636] [2024-11-09 01:37:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690173636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:37:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744323540] [2024-11-09 01:37:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:37:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:37:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:37:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:37:03,757 INFO L87 Difference]: Start difference. First operand 395 states and 576 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:03,821 INFO L93 Difference]: Finished difference Result 787 states and 1149 transitions. [2024-11-09 01:37:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:37:03,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-09 01:37:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:03,824 INFO L225 Difference]: With dead ends: 787 [2024-11-09 01:37:03,824 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 01:37:03,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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:37:03,827 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:03,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:37:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 01:37:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-09 01:37:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.4114285714285715) internal successors, (494), 354 states have internal predecessors, (494), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:37:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 574 transitions. [2024-11-09 01:37:03,862 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 574 transitions. Word has length 140 [2024-11-09 01:37:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:03,864 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 574 transitions. [2024-11-09 01:37:03,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:37:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 574 transitions. [2024-11-09 01:37:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:37:03,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:03,867 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,882 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:37:04,068 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:37:04,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash -839067348, now seen corresponding path program 1 times [2024-11-09 01:37:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:37:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231013408] [2024-11-09 01:37:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:04,070 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:37:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:37:04,071 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:37:04,072 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