./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.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 fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:30:35,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:30:35,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:30:35,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:30:35,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:30:35,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:30:35,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:30:35,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:30:35,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:30:35,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:30:35,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:30:35,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:30:35,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:30:35,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:30:35,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:30:35,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:30:35,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:30:35,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:30:35,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:30:35,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:30:35,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:30:35,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:30:35,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:30:35,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:30:35,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:30:35,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:35,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:30:35,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:30:35,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:30:35,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:30:35,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:30:35,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:30:35,979 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 -> fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 [2024-10-14 13:30:36,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:30:36,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:30:36,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:30:36,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:30:36,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:30:36,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:37,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:30:37,715 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:30:37,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:37,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9e1f683/06d19d5960ff4d309f019dac3c97cf14/FLAG9f6c93a06 [2024-10-14 13:30:38,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9e1f683/06d19d5960ff4d309f019dac3c97cf14 [2024-10-14 13:30:38,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:30:38,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:30:38,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:38,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:30:38,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:30:38,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331d051e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38, skipping insertion in model container [2024-10-14 13:30:38,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:30:38,266 WARN L248 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-95.i[916,929] [2024-10-14 13:30:38,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:38,337 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:30:38,345 WARN L248 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-95.i[916,929] [2024-10-14 13:30:38,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:38,386 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:30:38,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38 WrapperNode [2024-10-14 13:30:38,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:38,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:38,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:30:38,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:30:38,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,433 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-10-14 13:30:38,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:38,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:30:38,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:30:38,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:30:38,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,504 INFO L175 MemorySlicer]: Split 121 memory accesses to 7 slices as follows [2, 29, 15, 7, 7, 48, 13]. 40 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 1, 1, 4, 2]. The 16 writes are split as follows [0, 4, 2, 1, 3, 4, 2]. [2024-10-14 13:30:38,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:30:38,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:30:38,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:30:38,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:30:38,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:38,578 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-10-14 13:30:38,589 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-10-14 13:30:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:30:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:30:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:30:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:30:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:30:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:30:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:30:38,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:30:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:30:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:30:38,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:30:38,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:30:38,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:30:39,152 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-10-14 13:30:39,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:30:39,180 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:30:39,180 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:30:39,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:39 BoogieIcfgContainer [2024-10-14 13:30:39,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:30:39,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:30:39,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:30:39,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:30:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:30:38" (1/3) ... [2024-10-14 13:30:39,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f791fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:39, skipping insertion in model container [2024-10-14 13:30:39,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (2/3) ... [2024-10-14 13:30:39,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f791fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:39, skipping insertion in model container [2024-10-14 13:30:39,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:39" (3/3) ... [2024-10-14 13:30:39,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:39,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:30:39,200 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:30:39,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:30:39,247 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;@bf58da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:30:39,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:30:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:30:39,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:39,262 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:39,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:39,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash 371536252, now seen corresponding path program 1 times [2024-10-14 13:30:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875433619] [2024-10-14 13:30:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:30:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:30:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:30:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:30:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:30:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:30:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:30:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:30:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:30:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:30:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:30:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:30:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:30:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:30:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:39,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:39,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875433619] [2024-10-14 13:30:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875433619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:39,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:30:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090960891] [2024-10-14 13:30:39,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:30:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:39,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:30:39,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:30:39,863 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:39,947 INFO L93 Difference]: Finished difference Result 211 states and 334 transitions. [2024-10-14 13:30:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:30:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2024-10-14 13:30:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:39,959 INFO L225 Difference]: With dead ends: 211 [2024-10-14 13:30:39,959 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 13:30:39,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10-14 13:30:39,967 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:39,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 13:30:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 13:30:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-14 13:30:40,054 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 127 [2024-10-14 13:30:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:40,055 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-14 13:30:40,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-14 13:30:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:30:40,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:40,065 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:40,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:30:40,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:40,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1944368288, now seen corresponding path program 1 times [2024-10-14 13:30:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607053786] [2024-10-14 13:30:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:30:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:30:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:30:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:30:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:30:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:30:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:30:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:30:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:30:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:30:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:30:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:30:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:30:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:30:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607053786] [2024-10-14 13:30:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607053786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:40,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484721604] [2024-10-14 13:30:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:40,384 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:40,420 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-14 13:30:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-10-14 13:30:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:40,422 INFO L225 Difference]: With dead ends: 212 [2024-10-14 13:30:40,422 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 13:30:40,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-10-14 13:30:40,424 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:40,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 13:30:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 13:30:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-14 13:30:40,435 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 127 [2024-10-14 13:30:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:40,436 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-14 13:30:40,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-14 13:30:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:30:40,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:40,439 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:40,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:30:40,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:40,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1944427870, now seen corresponding path program 1 times [2024-10-14 13:30:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:40,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117876085] [2024-10-14 13:30:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:30:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:30:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:30:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:30:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:30:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:30:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:30:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:30:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:30:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:30:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:30:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:30:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:30:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:30:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:40,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:40,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117876085] [2024-10-14 13:30:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117876085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:40,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:40,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000308941] [2024-10-14 13:30:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:40,787 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:40,855 INFO L93 Difference]: Finished difference Result 214 states and 306 transitions. [2024-10-14 13:30:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-10-14 13:30:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:40,859 INFO L225 Difference]: With dead ends: 214 [2024-10-14 13:30:40,859 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 13:30:40,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:40,860 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:40,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 352 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 13:30:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 13:30:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-14 13:30:40,876 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 127 [2024-10-14 13:30:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:40,877 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-14 13:30:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-14 13:30:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:30:40,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:40,882 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:30:40,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 871044099, now seen corresponding path program 1 times [2024-10-14 13:30:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130738801] [2024-10-14 13:30:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:30:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:30:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:30:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:30:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:30:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:30:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:30:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:30:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:30:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:30:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:30:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:30:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:30:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:30:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 13:30:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130738801] [2024-10-14 13:30:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130738801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:30:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929520619] [2024-10-14 13:30:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:41,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:30:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:41,574 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-10-14 13:30:41,576 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-10-14 13:30:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 13:30:41,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:41,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-14 13:30:41,956 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 25 treesize of output 13 [2024-10-14 13:30:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:30:41,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:30:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 13:30:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929520619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:30:42,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:30:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-14 13:30:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735968155] [2024-10-14 13:30:42,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:30:42,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:30:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:42,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:30:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:30:42,258 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 15 states, 13 states have (on average 5.615384615384615) internal successors, (73), 15 states have internal predecessors, (73), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-14 13:30:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:42,712 INFO L93 Difference]: Finished difference Result 223 states and 313 transitions. [2024-10-14 13:30:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:30:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.615384615384615) internal successors, (73), 15 states have internal predecessors, (73), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 129 [2024-10-14 13:30:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:42,714 INFO L225 Difference]: With dead ends: 223 [2024-10-14 13:30:42,714 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 13:30:42,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:30:42,715 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 120 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:42,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 650 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:30:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 13:30:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-10-14 13:30:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-14 13:30:42,732 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 129 [2024-10-14 13:30:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-14 13:30:42,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.615384615384615) internal successors, (73), 15 states have internal predecessors, (73), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-14 13:30:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-14 13:30:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:30:42,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:42,736 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:42,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:30:42,936 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-10-14 13:30:42,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1967223587, now seen corresponding path program 1 times [2024-10-14 13:30:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022510704] [2024-10-14 13:30:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:30:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:30:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:30:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:30:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:30:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:30:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:30:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:30:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:30:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:30:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:30:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:30:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:30:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:30:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022510704] [2024-10-14 13:30:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022510704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:43,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:30:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3636624] [2024-10-14 13:30:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:43,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:30:43,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:30:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:30:43,603 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:44,010 INFO L93 Difference]: Finished difference Result 363 states and 505 transitions. [2024-10-14 13:30:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:30:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-14 13:30:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:44,013 INFO L225 Difference]: With dead ends: 363 [2024-10-14 13:30:44,014 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 13:30:44,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-14 13:30:44,015 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 207 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:44,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 898 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:30:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 13:30:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2024-10-14 13:30:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 135 states have internal predecessors, (176), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:30:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 240 transitions. [2024-10-14 13:30:44,041 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 240 transitions. Word has length 130 [2024-10-14 13:30:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:44,041 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 240 transitions. [2024-10-14 13:30:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2024-10-14 13:30:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:30:44,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:44,042 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:44,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:30:44,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:44,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash -859406043, now seen corresponding path program 1 times [2024-10-14 13:30:44,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:44,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891910618] [2024-10-14 13:30:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:30:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24339872] [2024-10-14 13:30:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:44,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:30:44,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:44,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:30:44,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:30:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:30:44,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:30:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:30:44,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:30:44,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:30:44,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:30:44,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:30:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 13:30:44,880 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 13:30:44,947 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:30:44,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:30:44 BoogieIcfgContainer [2024-10-14 13:30:44,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:30:44,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:30:44,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:30:44,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:30:44,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:39" (3/4) ... [2024-10-14 13:30:44,951 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:30:44,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:30:44,953 INFO L158 Benchmark]: Toolchain (without parser) took 6865.96ms. Allocated memory was 228.6MB in the beginning and 327.2MB in the end (delta: 98.6MB). Free memory was 197.2MB in the beginning and 183.6MB in the end (delta: 13.6MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,953 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:30:44,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.99ms. Allocated memory is still 228.6MB. Free memory was 197.0MB in the beginning and 186.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.48ms. Allocated memory is still 228.6MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,954 INFO L158 Benchmark]: Boogie Preprocessor took 112.58ms. Allocated memory is still 228.6MB. Free memory was 182.0MB in the beginning and 175.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,954 INFO L158 Benchmark]: RCFGBuilder took 633.68ms. Allocated memory is still 228.6MB. Free memory was 175.7MB in the beginning and 135.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,954 INFO L158 Benchmark]: TraceAbstraction took 5766.48ms. Allocated memory was 228.6MB in the beginning and 327.2MB in the end (delta: 98.6MB). Free memory was 134.7MB in the beginning and 183.6MB in the end (delta: -48.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-10-14 13:30:44,955 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 327.2MB. Free memory is still 183.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:30:44,956 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.13ms. Allocated memory is still 130.0MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.99ms. Allocated memory is still 228.6MB. Free memory was 197.0MB in the beginning and 186.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.48ms. Allocated memory is still 228.6MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.58ms. Allocated memory is still 228.6MB. Free memory was 182.0MB in the beginning and 175.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 633.68ms. Allocated memory is still 228.6MB. Free memory was 175.7MB in the beginning and 135.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5766.48ms. Allocated memory was 228.6MB in the beginning and 327.2MB in the end (delta: 98.6MB). Free memory was 134.7MB in the beginning and 183.6MB in the end (delta: -48.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 327.2MB. Free memory is still 183.6MB. 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 92, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L22-L24] float float_Array_0[2][2] = { {50.4, 8.54}, {255.8, 1.8} }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L25-L27] signed char signed_char_Array_0[2] = { -1, -16 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {2, 0}, {32, 5} }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 16 }; [L40] unsigned char last_1_unsigned_char_Array_0_0__1_ = 0; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR unsigned_char_Array_0[0][1] [L89] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L62] float_Array_0[0][0] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[0][0] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L63] EXPR float_Array_0[0][0] [L63] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] float_Array_0[1][0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[1][0] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L65] EXPR float_Array_0[1][0] [L65] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] float_Array_0[0][1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[0][1] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L67] EXPR float_Array_0[0][1] [L67] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L69] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L75] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L78] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967295) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] RET updateVariables() [L101] CALL step() [L44] signed_long_int_Array_0[0] = ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))) [L45] EXPR float_Array_0[0][1] [L45] EXPR float_Array_0[1][0] [L45] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L45] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) [L45] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L45] float_Array_0[1][1] = ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))) [L46] EXPR signed_char_Array_0[1] [L46] signed_char_Array_0[0] = signed_char_Array_0[1] [L47] EXPR signed_char_Array_0[0] [L47] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] EXPR signed_char_Array_0[0] & signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] signed long int stepLocal_0 = signed_char_Array_0[0] & signed_long_int_Array_0[0]; [L48] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND TRUE (- (3351680781u - unsigned_long_int_Array_0[0])) > stepLocal_0 [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR unsigned_char_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR ((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]) [L49] EXPR unsigned_char_Array_0[1][1] [L49] EXPR ((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))) [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L49] EXPR unsigned_char_Array_0[0][0] [L49] unsigned_char_Array_0[0][1] = (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]) [L51] EXPR signed_char_Array_0[0] [L51] EXPR unsigned_long_int_Array_0[1] [L51] EXPR unsigned_char_Array_0[0][1] [L51] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L51] EXPR unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L51] COND FALSE !((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) [L54] EXPR signed_char_Array_0[0] [L54] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND TRUE signed_char_Array_0[0] >= signed_long_int_Array_0[0] [L55] EXPR unsigned_char_Array_0[0][0] [L55] EXPR unsigned_char_Array_0[1][1] [L55] signed_short_int_Array_0[0] = (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR signed_long_int_Array_0[0] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[0][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) [L92] EXPR ((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256)))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR (((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256)))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92-L93] return ((((signed_long_int_Array_0[0] == ((signed long int) ((((last_1_unsigned_char_Array_0_0__1_) < 0 ) ? -(last_1_unsigned_char_Array_0_0__1_) : (last_1_unsigned_char_Array_0_0__1_))))) && (float_Array_0[1][1] == ((float) ((float_Array_0[0][1] - float_Array_0[1][0]) + ((((256.5f) < ((float_Array_0[0][0] - 16.125f))) ? (256.5f) : ((float_Array_0[0][0] - 16.125f)))))))) && (((- (3351680781u - unsigned_long_int_Array_0[0])) > (signed_char_Array_0[0] & signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0][1] == ((unsigned char) (((((unsigned_char_Array_0[1][0]) < (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1]))))) ? (unsigned_char_Array_0[1][0]) : (((((unsigned_char_Array_0[1][1]) < 0 ) ? -(unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][1])))))) + unsigned_char_Array_0[0][0]))) : 1)) && (((signed_char_Array_0[0] / unsigned_long_int_Array_0[1]) < (unsigned_char_Array_0[0][1] >> unsigned_char_Array_0[0][1])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((4 - unsigned_char_Array_0[1][1]) < 0 ) ? -(4 - unsigned_char_Array_0[1][1]) : (4 - unsigned_char_Array_0[1][1]))))) : ((signed_char_Array_0[0] >= signed_long_int_Array_0[0]) ? (signed_short_int_Array_0[0] == ((signed short int) (-5 + (unsigned_char_Array_0[0][0] - unsigned_char_Array_0[1][1])))) : (signed_short_int_Array_0[0] == ((signed short int) 256))))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 2475 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1801 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 674 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 2003 SizeOfPredicates, 7 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3333/3360 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-10-14 13:30:44,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.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 fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:30:46,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:30:46,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:30:46,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:30:46,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:30:46,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:30:46,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:30:46,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:30:46,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:30:46,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:30:46,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:30:46,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:30:46,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:30:46,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:30:46,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:30:46,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:30:46,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:30:46,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:30:46,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:30:46,978 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:30:46,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:30:46,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:30:46,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:30:46,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:30:46,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:30:46,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:30:46,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:30:46,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:30:46,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:30:46,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:46,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:30:46,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:30:46,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:30:46,982 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:30:46,982 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:30:46,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:30:46,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:30:46,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:30:46,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:30:46,983 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:30:46,983 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 -> fc5530f3297a60a6e62c32967b204622cc9ceb16e657d6b09a8ffa710c752296 [2024-10-14 13:30:47,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:30:47,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:30:47,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:30:47,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:30:47,225 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:30:47,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:48,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:30:48,801 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:30:48,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:48,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba5f2c76/03d53eae915a4987bf16e81ecc340898/FLAG64576a320 [2024-10-14 13:30:49,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aba5f2c76/03d53eae915a4987bf16e81ecc340898 [2024-10-14 13:30:49,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:30:49,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:30:49,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:49,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:30:49,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:30:49,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152f30d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49, skipping insertion in model container [2024-10-14 13:30:49,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:30:49,351 WARN L248 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-95.i[916,929] [2024-10-14 13:30:49,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:49,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:30:49,497 WARN L248 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-95.i[916,929] [2024-10-14 13:30:49,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:49,577 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:30:49,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49 WrapperNode [2024-10-14 13:30:49,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:49,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:49,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:30:49,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:30:49,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,681 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-10-14 13:30:49,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:49,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:30:49,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:30:49,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:30:49,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,776 INFO L175 MemorySlicer]: Split 121 memory accesses to 7 slices as follows [2, 29, 15, 7, 7, 48, 13]. 40 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 1, 1, 4, 2]. The 16 writes are split as follows [0, 4, 2, 1, 3, 4, 2]. [2024-10-14 13:30:49,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:30:49,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:30:49,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:30:49,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:30:49,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (1/1) ... [2024-10-14 13:30:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:49,942 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-10-14 13:30:49,947 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-10-14 13:30:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:30:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:30:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:30:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:30:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:30:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:30:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:30:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:30:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:30:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:30:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:30:49,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:30:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:30:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:30:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:30:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:30:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:30:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:30:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:30:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:30:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:30:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:30:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:30:49,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:30:49,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:30:49,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:30:50,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:30:50,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:30:51,117 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-14 13:30:51,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:30:51,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:30:51,181 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:30:51,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:51 BoogieIcfgContainer [2024-10-14 13:30:51,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:30:51,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:30:51,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:30:51,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:30:51,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:30:49" (1/3) ... [2024-10-14 13:30:51,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c243bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:51, skipping insertion in model container [2024-10-14 13:30:51,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:49" (2/3) ... [2024-10-14 13:30:51,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c243bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:51, skipping insertion in model container [2024-10-14 13:30:51,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:51" (3/3) ... [2024-10-14 13:30:51,190 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-95.i [2024-10-14 13:30:51,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:30:51,217 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:30:51,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:30:51,286 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;@75d2cd34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:30:51,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:30:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:30:51,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:51,303 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:51,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:51,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 240275824, now seen corresponding path program 1 times [2024-10-14 13:30:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314784381] [2024-10-14 13:30:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:51,321 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-10-14 13:30:51,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:51,324 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-10-14 13:30:51,324 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-10-14 13:30:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:51,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:30:51,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-14 13:30:51,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:51,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314784381] [2024-10-14 13:30:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314784381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:30:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811742276] [2024-10-14 13:30:51,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:30:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:30:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:30:51,781 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:51,824 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-14 13:30:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:30:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-14 13:30:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:51,835 INFO L225 Difference]: With dead ends: 189 [2024-10-14 13:30:51,835 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 13:30:51,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:30:51,842 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:51,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 13:30:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 13:30:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-14 13:30:51,875 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 124 [2024-10-14 13:30:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:51,876 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-14 13:30:51,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-14 13:30:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:30:51,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:51,878 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:51,889 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-10-14 13:30:52,082 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-10-14 13:30:52,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash 721567948, now seen corresponding path program 1 times [2024-10-14 13:30:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580317105] [2024-10-14 13:30:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:52,085 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-10-14 13:30:52,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:52,088 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-10-14 13:30:52,088 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-10-14 13:30:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:52,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:30:52,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:52,539 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 21 treesize of output 9 [2024-10-14 13:30:52,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:30:52,895 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 54 treesize of output 42 [2024-10-14 13:30:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:52,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:52,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580317105] [2024-10-14 13:30:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580317105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714690126] [2024-10-14 13:30:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:52,910 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:54,261 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2024-10-14 13:30:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:30:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-10-14 13:30:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:54,264 INFO L225 Difference]: With dead ends: 366 [2024-10-14 13:30:54,264 INFO L226 Difference]: Without dead ends: 273 [2024-10-14 13:30:54,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:30:54,266 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 245 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:54,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 638 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 13:30:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-14 13:30:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 192. [2024-10-14 13:30:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 157 states have internal predecessors, (211), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:30:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 275 transitions. [2024-10-14 13:30:54,299 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 275 transitions. Word has length 124 [2024-10-14 13:30:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:54,299 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 275 transitions. [2024-10-14 13:30:54,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 275 transitions. [2024-10-14 13:30:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:54,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:54,305 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:54,320 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-10-14 13:30:54,506 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-10-14 13:30:54,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:54,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1240445425, now seen corresponding path program 1 times [2024-10-14 13:30:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254355560] [2024-10-14 13:30:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:54,509 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-10-14 13:30:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:54,510 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-10-14 13:30:54,512 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-10-14 13:30:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:54,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:30:54,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:54,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:54,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254355560] [2024-10-14 13:30:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254355560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:54,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:54,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657627989] [2024-10-14 13:30:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:54,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:54,948 INFO L87 Difference]: Start difference. First operand 192 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:55,007 INFO L93 Difference]: Finished difference Result 393 states and 563 transitions. [2024-10-14 13:30:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:55,009 INFO L225 Difference]: With dead ends: 393 [2024-10-14 13:30:55,009 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 13:30:55,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:55,011 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:55,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 13:30:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-14 13:30:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 165 states have internal predecessors, (219), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:30:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2024-10-14 13:30:55,025 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 126 [2024-10-14 13:30:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:55,026 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2024-10-14 13:30:55,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2024-10-14 13:30:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:55,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:55,027 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:55,040 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-10-14 13:30:55,231 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-10-14 13:30:55,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:55,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1240505007, now seen corresponding path program 1 times [2024-10-14 13:30:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173959884] [2024-10-14 13:30:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:55,236 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-10-14 13:30:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:55,239 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-10-14 13:30:55,241 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-10-14 13:30:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:55,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 13:30:55,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:55,701 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 77 treesize of output 41 [2024-10-14 13:30:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:55,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:55,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173959884] [2024-10-14 13:30:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173959884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:55,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:55,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051302263] [2024-10-14 13:30:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:55,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:55,727 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:56,794 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-10-14 13:30:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:30:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:56,796 INFO L225 Difference]: With dead ends: 401 [2024-10-14 13:30:56,796 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 13:30:56,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:30:56,798 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 131 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:56,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 410 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 13:30:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 13:30:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-14 13:30:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 165 states have internal predecessors, (217), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:30:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2024-10-14 13:30:56,819 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 126 [2024-10-14 13:30:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2024-10-14 13:30:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2024-10-14 13:30:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:30:56,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:56,821 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:56,851 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-10-14 13:30:57,021 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-10-14 13:30:57,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:57,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash 713632169, now seen corresponding path program 1 times [2024-10-14 13:30:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442094343] [2024-10-14 13:30:57,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:57,023 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-10-14 13:30:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:57,025 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-10-14 13:30:57,032 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-10-14 13:30:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:57,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:30:57,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:57,477 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 95 treesize of output 41 [2024-10-14 13:30:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:30:57,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:57,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442094343] [2024-10-14 13:30:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442094343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673875276] [2024-10-14 13:30:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:57,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:57,520 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:58,407 INFO L93 Difference]: Finished difference Result 401 states and 563 transitions. [2024-10-14 13:30:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:30:58,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-10-14 13:30:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:58,409 INFO L225 Difference]: With dead ends: 401 [2024-10-14 13:30:58,409 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 13:30:58,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:30:58,410 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 119 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:58,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 405 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:30:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 13:30:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-14 13:30:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:30:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2024-10-14 13:30:58,422 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 128 [2024-10-14 13:30:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:58,422 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2024-10-14 13:30:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2024-10-14 13:30:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:30:58,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:58,423 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:30:58,438 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-10-14 13:30:58,624 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-10-14 13:30:58,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:58,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 279634031, now seen corresponding path program 1 times [2024-10-14 13:30:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092753436] [2024-10-14 13:30:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:58,626 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-10-14 13:30:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:58,630 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-10-14 13:30:58,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 13:30:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:59,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:30:59,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:59,117 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 95 treesize of output 41 [2024-10-14 13:30:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-14 13:30:59,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:59,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092753436] [2024-10-14 13:30:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092753436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599876261] [2024-10-14 13:30:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:59,138 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:00,128 INFO L93 Difference]: Finished difference Result 401 states and 559 transitions. [2024-10-14 13:31:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:31:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-10-14 13:31:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:00,130 INFO L225 Difference]: With dead ends: 401 [2024-10-14 13:31:00,130 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 13:31:00,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:31:00,131 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 111 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:00,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 13:31:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 13:31:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-14 13:31:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 165 states have (on average 1.290909090909091) internal successors, (213), 165 states have internal predecessors, (213), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:31:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 277 transitions. [2024-10-14 13:31:00,141 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 277 transitions. Word has length 130 [2024-10-14 13:31:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 277 transitions. [2024-10-14 13:31:00,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 277 transitions. [2024-10-14 13:31:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:00,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:00,142 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:31:00,158 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 (7)] Ended with exit code 0 [2024-10-14 13:31:00,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:00,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1118696087, now seen corresponding path program 1 times [2024-10-14 13:31:00,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396998837] [2024-10-14 13:31:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:00,344 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-10-14 13:31:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:00,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:00,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 13:31:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:01,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 13:31:01,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:01,168 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 21 treesize of output 9 [2024-10-14 13:31:01,280 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 8 treesize of output 1 [2024-10-14 13:31:01,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 13:31:01,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:01,492 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 15 treesize of output 7 [2024-10-14 13:31:01,497 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 26 treesize of output 18 [2024-10-14 13:31:01,501 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 14 treesize of output 10 [2024-10-14 13:31:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:31:01,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:31:01,553 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 23 treesize of output 19 [2024-10-14 13:31:01,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396998837] [2024-10-14 13:31:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396998837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:31:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1701116727] [2024-10-14 13:31:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:31:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:31:01,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:31:01,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-14 13:31:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:02,006 WARN L253 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-10-14 13:31:02,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:02,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:03,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:04,201 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 12 treesize of output 8 [2024-10-14 13:31:05,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-10-14 13:31:06,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-10-14 13:31:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-10-14 13:31:08,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:10,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 13:31:12,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:12,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 13:31:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 420 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 13:31:12,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:31:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 13:31:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1701116727] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:31:13,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:31:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 9] total 41 [2024-10-14 13:31:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480874145] [2024-10-14 13:31:13,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:31:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 13:31:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:13,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 13:31:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 13:31:13,152 INFO L87 Difference]: Start difference. First operand 200 states and 277 transitions. Second operand has 41 states, 26 states have (on average 6.230769230769231) internal successors, (162), 41 states have internal predecessors, (162), 20 states have call successors, (48), 9 states have call predecessors, (48), 12 states have return successors, (48), 10 states have call predecessors, (48), 20 states have call successors, (48) [2024-10-14 13:31:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:21,323 INFO L93 Difference]: Finished difference Result 454 states and 617 transitions. [2024-10-14 13:31:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 13:31:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 26 states have (on average 6.230769230769231) internal successors, (162), 41 states have internal predecessors, (162), 20 states have call successors, (48), 9 states have call predecessors, (48), 12 states have return successors, (48), 10 states have call predecessors, (48), 20 states have call successors, (48) Word has length 132 [2024-10-14 13:31:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:21,326 INFO L225 Difference]: With dead ends: 454 [2024-10-14 13:31:21,331 INFO L226 Difference]: Without dead ends: 255 [2024-10-14 13:31:21,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=663, Invalid=3243, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 13:31:21,333 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 385 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:21,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1538 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-14 13:31:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-14 13:31:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 246. [2024-10-14 13:31:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 196 states have (on average 1.25) internal successors, (245), 197 states have internal predecessors, (245), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:31:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 331 transitions. [2024-10-14 13:31:21,377 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 331 transitions. Word has length 132 [2024-10-14 13:31:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 331 transitions. [2024-10-14 13:31:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 26 states have (on average 6.230769230769231) internal successors, (162), 41 states have internal predecessors, (162), 20 states have call successors, (48), 9 states have call predecessors, (48), 12 states have return successors, (48), 10 states have call predecessors, (48), 20 states have call successors, (48) [2024-10-14 13:31:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2024-10-14 13:31:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:31:21,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:21,381 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:31:21,397 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 (8)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:21,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-14 13:31:21,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 13:31:21,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 574828646, now seen corresponding path program 1 times [2024-10-14 13:31:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122242604] [2024-10-14 13:31:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:21,787 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-10-14 13:31:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:21,789 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-14 13:31:21,790 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 (10)] Waiting until timeout for monitored process