./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-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:31:02,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:31:02,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:31:02,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:31:02,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:31:02,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:31:02,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:31:02,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:31:02,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:31:02,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:31:02,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:31:02,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:31:02,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:31:02,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:31:02,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:31:02,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:31:02,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:31:02,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:31:02,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:31:02,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:31:02,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:31:02,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:31:02,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:31:02,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:31:02,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:31:02,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:31:02,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:31:02,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:31:02,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:31:02,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:31:02,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:31:02,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:31:02,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:31:02,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:31:02,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:31:02,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:31:02,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:31:02,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:31:02,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:31:02,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:31:02,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:31:02,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:31:02,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-20 08:31:02,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:31:02,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:31:02,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:31:02,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:31:02,639 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:31:02,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:04,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:31:04,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:31:04,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:04,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb4849c6/74fd8c5a51ea47f28f057cf3c91e22b5/FLAGc2f493e7a [2024-11-20 08:31:04,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb4849c6/74fd8c5a51ea47f28f057cf3c91e22b5 [2024-11-20 08:31:04,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:31:04,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:31:04,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:31:04,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:31:04,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:31:04,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2d2fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04, skipping insertion in model container [2024-11-20 08:31:04,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:31:04,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-20 08:31:04,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:31:04,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:31:04,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-20 08:31:04,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:31:04,724 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:31:04,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04 WrapperNode [2024-11-20 08:31:04,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:31:04,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:31:04,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:31:04,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:31:04,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,788 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 582 [2024-11-20 08:31:04,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:31:04,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:31:04,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:31:04,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:31:04,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,841 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-20 08:31:04,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:31:04,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:31:04,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:31:04,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:31:04,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (1/1) ... [2024-11-20 08:31:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:31:04,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:31:04,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:31:04,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:31:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:31:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:31:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:31:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:31:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:31:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:31:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:31:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:31:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:31:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:31:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:31:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:31:05,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:31:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:31:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:31:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:31:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:31:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:31:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:31:05,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:31:05,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:31:05,677 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-20 08:31:05,679 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:31:05,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:31:05,695 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:31:05,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:05 BoogieIcfgContainer [2024-11-20 08:31:05,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:31:05,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:31:05,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:31:05,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:31:05,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:31:04" (1/3) ... [2024-11-20 08:31:05,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b3744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:05, skipping insertion in model container [2024-11-20 08:31:05,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:04" (2/3) ... [2024-11-20 08:31:05,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b3744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:05, skipping insertion in model container [2024-11-20 08:31:05,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:05" (3/3) ... [2024-11-20 08:31:05,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:05,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:31:05,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:31:05,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:31:05,789 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;@fe41fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:31:05,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:31:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 08:31:05,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:05,807 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:05,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:05,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1430690379, now seen corresponding path program 1 times [2024-11-20 08:31:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:31:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833022904] [2024-11-20 08:31:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:31:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:31:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:31:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 08:31:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:31:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:31:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:31:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:31:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:31:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:31:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:31:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:31:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:31:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:31:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:31:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:31:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:31:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:31:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 08:31:06,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:31:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833022904] [2024-11-20 08:31:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833022904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:31:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701752899] [2024-11-20 08:31:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:06,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:31:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:31:06,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:31:06,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:31:06,385 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:06,417 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-20 08:31:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:31:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-20 08:31:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:06,427 INFO L225 Difference]: With dead ends: 243 [2024-11-20 08:31:06,428 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 08:31:06,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:31:06,435 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:06,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:31:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 08:31:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 08:31:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-20 08:31:06,491 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-20 08:31:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-20 08:31:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-20 08:31:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 08:31:06,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:06,498 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:06,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:31:06,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1147655401, now seen corresponding path program 1 times [2024-11-20 08:31:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:31:06,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852253934] [2024-11-20 08:31:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:31:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:31:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:31:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 08:31:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:31:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:31:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:31:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:31:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:31:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:31:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:31:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:31:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:31:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:31:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:31:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:31:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:31:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:06,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:31:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 08:31:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:31:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852253934] [2024-11-20 08:31:07,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852253934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:07,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:31:07,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008732127] [2024-11-20 08:31:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:07,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:31:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:31:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:31:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:07,010 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:07,051 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-20 08:31:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:31:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-20 08:31:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:07,056 INFO L225 Difference]: With dead ends: 241 [2024-11-20 08:31:07,056 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 08:31:07,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:07,058 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:07,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:31:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 08:31:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-20 08:31:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-20 08:31:07,081 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-20 08:31:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-20 08:31:07,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-20 08:31:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:31:07,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:07,092 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:07,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:31:07,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:07,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash -530064823, now seen corresponding path program 1 times [2024-11-20 08:31:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:31:07,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398582113] [2024-11-20 08:31:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:31:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:31:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:31:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 08:31:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:31:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:31:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:31:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:31:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:31:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:31:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:31:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:31:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:31:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:31:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:31:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:31:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:31:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:31:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 08:31:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:31:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398582113] [2024-11-20 08:31:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398582113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:07,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:07,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:31:07,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073812048] [2024-11-20 08:31:07,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:07,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:31:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:31:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:31:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:31:07,815 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:08,006 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2024-11-20 08:31:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:31:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-20 08:31:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:08,009 INFO L225 Difference]: With dead ends: 331 [2024-11-20 08:31:08,009 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 08:31:08,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:31:08,015 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 111 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:08,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1148 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:31:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 08:31:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-20 08:31:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 186 states have internal predecessors, (263), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:31:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 303 transitions. [2024-11-20 08:31:08,032 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 303 transitions. Word has length 140 [2024-11-20 08:31:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:08,032 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 303 transitions. [2024-11-20 08:31:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 303 transitions. [2024-11-20 08:31:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:31:08,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:08,039 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:08,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:31:08,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:08,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash 104451762, now seen corresponding path program 1 times [2024-11-20 08:31:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:31:08,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660354193] [2024-11-20 08:31:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:08,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:31:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:31:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703885373] [2024-11-20 08:31:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:31:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:31:08,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:31:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:31:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:31:08,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:31:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:31:08,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:31:08,895 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:31:08,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:31:08,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:31:09,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:31:09,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 08:31:09,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:31:09,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:31:09 BoogieIcfgContainer [2024-11-20 08:31:09,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:31:09,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:31:09,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:31:09,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:31:09,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:05" (3/4) ... [2024-11-20 08:31:09,205 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:31:09,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:31:09,208 INFO L158 Benchmark]: Toolchain (without parser) took 4909.84ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 82.6MB in the beginning and 120.9MB in the end (delta: -38.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,209 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:31:09,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.24ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 116.9MB in the end (delta: -34.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.00ms. Allocated memory is still 151.0MB. Free memory was 116.9MB in the beginning and 112.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,209 INFO L158 Benchmark]: Boogie Preprocessor took 124.48ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 107.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,210 INFO L158 Benchmark]: RCFGBuilder took 781.15ms. Allocated memory is still 151.0MB. Free memory was 107.5MB in the beginning and 69.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,211 INFO L158 Benchmark]: TraceAbstraction took 3503.39ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 68.7MB in the beginning and 120.9MB in the end (delta: -52.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-20 08:31:09,211 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 213.9MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:31:09,214 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.17ms. Allocated memory is still 151.0MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.24ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 116.9MB in the end (delta: -34.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.00ms. Allocated memory is still 151.0MB. Free memory was 116.9MB in the beginning and 112.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.48ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 107.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 781.15ms. Allocated memory is still 151.0MB. Free memory was 107.5MB in the beginning and 69.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3503.39ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 68.7MB in the beginning and 120.9MB in the end (delta: -52.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 213.9MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; VAL [float_Array_0={4:0}, isInitial=0, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L64] float_Array_0[0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L68] float_Array_0[2] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L70] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L71] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L73] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L76] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L79] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L80] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[0][2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L103] RET updateVariables() [L104] CALL step() [L34] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L34] COND FALSE !(float_Array_0[2] >= 50.4f) [L37] EXPR unsigned_long_int_Array_0[0][2] [L37] EXPR unsigned_long_int_Array_0[1][2] [L37] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L37] COND FALSE !(unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) [L44] EXPR signed_short_int_Array_0[1] [L44] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L46] EXPR unsigned_long_int_Array_0[1][1] [L46] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L46] COND FALSE !(! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] unsigned_long_int_Array_0[0][0] = ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))) [L51] EXPR unsigned_long_int_Array_0[1][0] [L51] EXPR unsigned_long_int_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) [L60] EXPR signed_short_int_Array_0[3] [L60] signed_short_int_Array_0[0] = signed_short_int_Array_0[3] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 [L95] EXPR unsigned_long_int_Array_0[1][2] [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95-L96] return ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1839 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 554 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:31:09,243 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-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:31:11,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:31:11,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:31:11,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:31:11,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:31:11,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:31:11,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:31:11,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:31:11,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:31:11,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:31:11,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:31:11,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:31:11,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:31:11,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:31:11,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:31:11,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:31:11,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:31:11,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:31:11,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:31:11,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:31:11,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:31:11,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:31:11,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:31:11,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:31:11,595 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:31:11,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:31:11,596 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:31:11,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:31:11,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:31:11,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:31:11,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:31:11,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:31:11,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:31:11,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:31:11,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:31:11,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:31:11,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:31:11,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:31:11,608 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:31:11,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:31:11,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:31:11,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:31:11,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:31:11,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:31:11,611 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-11-20 08:31:11,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:31:11,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:31:11,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:31:11,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:31:11,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:31:11,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:13,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:31:13,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:31:13,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:13,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74a360d3/1c44f8fa2d79436fbcb70f43d09fac02/FLAG8496db892 [2024-11-20 08:31:13,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74a360d3/1c44f8fa2d79436fbcb70f43d09fac02 [2024-11-20 08:31:13,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:31:13,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:31:13,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:31:13,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:31:13,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:31:13,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:13" (1/1) ... [2024-11-20 08:31:13,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3916d172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:13, skipping insertion in model container [2024-11-20 08:31:13,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:13" (1/1) ... [2024-11-20 08:31:13,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:31:14,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-20 08:31:14,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:31:14,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:31:14,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i[916,929] [2024-11-20 08:31:14,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:31:14,272 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:31:14,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14 WrapperNode [2024-11-20 08:31:14,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:31:14,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:31:14,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:31:14,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:31:14,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,363 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-11-20 08:31:14,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:31:14,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:31:14,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:31:14,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:31:14,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,428 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-11-20 08:31:14,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:31:14,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:31:14,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:31:14,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:31:14,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (1/1) ... [2024-11-20 08:31:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:31:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:31:14,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:31:14,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:31:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:31:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:31:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:31:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:31:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:31:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:31:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:31:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:31:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:31:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:31:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:31:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:31:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:31:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:31:14,791 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:31:14,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:31:16,013 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-11-20 08:31:16,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:31:16,028 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:31:16,028 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:31:16,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:16 BoogieIcfgContainer [2024-11-20 08:31:16,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:31:16,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:31:16,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:31:16,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:31:16,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:31:13" (1/3) ... [2024-11-20 08:31:16,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267e7d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:16, skipping insertion in model container [2024-11-20 08:31:16,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:14" (2/3) ... [2024-11-20 08:31:16,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267e7d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:16, skipping insertion in model container [2024-11-20 08:31:16,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:16" (3/3) ... [2024-11-20 08:31:16,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-11-20 08:31:16,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:31:16,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:31:16,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:31:16,129 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;@5148f8d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:31:16,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:31:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 08:31:16,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:16,147 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:16,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:16,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1430690379, now seen corresponding path program 1 times [2024-11-20 08:31:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260097043] [2024-11-20 08:31:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:16,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:16,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:31:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:16,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:31:16,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:31:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-20 08:31:16,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:31:16,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:31:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260097043] [2024-11-20 08:31:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260097043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:16,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:16,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:31:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467516634] [2024-11-20 08:31:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:31:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:31:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:31:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:31:16,608 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:16,640 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-11-20 08:31:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:31:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-20 08:31:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:16,649 INFO L225 Difference]: With dead ends: 243 [2024-11-20 08:31:16,649 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 08:31:16,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:31:16,654 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:16,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:31:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 08:31:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 08:31:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-20 08:31:16,701 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 138 [2024-11-20 08:31:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:16,701 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-20 08:31:16,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-20 08:31:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 08:31:16,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:16,706 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:16,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:31:16,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:16,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1147655401, now seen corresponding path program 1 times [2024-11-20 08:31:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118440221] [2024-11-20 08:31:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:16,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:16,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:16,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:16,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:31:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:17,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:31:17,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:31:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 08:31:17,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:31:17,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:31:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118440221] [2024-11-20 08:31:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118440221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:31:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722910094] [2024-11-20 08:31:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:17,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:31:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:31:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:31:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:17,299 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:17,369 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-20 08:31:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:31:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-20 08:31:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:17,372 INFO L225 Difference]: With dead ends: 241 [2024-11-20 08:31:17,372 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 08:31:17,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:17,378 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:17,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:31:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 08:31:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-20 08:31:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 08:31:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-20 08:31:17,396 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 138 [2024-11-20 08:31:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-20 08:31:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 08:31:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-20 08:31:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:31:17,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:17,403 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:17,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:31:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:17,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -530064823, now seen corresponding path program 1 times [2024-11-20 08:31:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383613321] [2024-11-20 08:31:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:17,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:17,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:31:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:17,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:31:17,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:31:18,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:31:18,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 08:31:18,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-20 08:31:18,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:31:18,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-20 08:31:18,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:31:18,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2024-11-20 08:31:18,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:31:18,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 34 [2024-11-20 08:31:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:31:18,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:31:18,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:31:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383613321] [2024-11-20 08:31:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383613321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:31:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532374083] [2024-11-20 08:31:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:18,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:31:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:31:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:31:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:31:18,739 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:19,732 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2024-11-20 08:31:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:31:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-20 08:31:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:19,738 INFO L225 Difference]: With dead ends: 331 [2024-11-20 08:31:19,738 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 08:31:19,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:31:19,740 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 315 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:19,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 880 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 08:31:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 08:31:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-20 08:31:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 186 states have internal predecessors, (263), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:31:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 303 transitions. [2024-11-20 08:31:19,760 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 303 transitions. Word has length 140 [2024-11-20 08:31:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 303 transitions. [2024-11-20 08:31:19,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 303 transitions. [2024-11-20 08:31:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:31:19,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:19,764 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:19,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 08:31:19,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:19,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:19,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 104451762, now seen corresponding path program 1 times [2024-11-20 08:31:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276851833] [2024-11-20 08:31:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:19,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:19,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:19,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:19,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:31:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:20,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:31:20,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:31:21,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-20 08:31:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-20 08:31:21,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:31:21,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:31:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276851833] [2024-11-20 08:31:21,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276851833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:21,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:31:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317733913] [2024-11-20 08:31:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:21,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:31:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:31:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:31:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:31:21,302 INFO L87 Difference]: Start difference. First operand 208 states and 303 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:23,175 INFO L93 Difference]: Finished difference Result 604 states and 881 transitions. [2024-11-20 08:31:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:31:23,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-20 08:31:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:23,183 INFO L225 Difference]: With dead ends: 604 [2024-11-20 08:31:23,186 INFO L226 Difference]: Without dead ends: 399 [2024-11-20 08:31:23,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:31:23,188 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 336 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:23,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 639 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 08:31:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-20 08:31:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2024-11-20 08:31:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.417142857142857) internal successors, (496), 354 states have internal predecessors, (496), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:31:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2024-11-20 08:31:23,234 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 140 [2024-11-20 08:31:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:23,235 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2024-11-20 08:31:23,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2024-11-20 08:31:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:31:23,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:23,238 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:23,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:31:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:23,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:23,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1617550924, now seen corresponding path program 1 times [2024-11-20 08:31:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163505853] [2024-11-20 08:31:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:23,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:23,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:23,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:31:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:31:23,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:31:23,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:31:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-20 08:31:23,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:31:23,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:31:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163505853] [2024-11-20 08:31:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163505853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:31:23,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:31:23,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:31:23,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571648039] [2024-11-20 08:31:23,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:31:23,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:31:23,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:31:23,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:31:23,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:23,682 INFO L87 Difference]: Start difference. First operand 395 states and 576 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:31:23,736 INFO L93 Difference]: Finished difference Result 787 states and 1149 transitions. [2024-11-20 08:31:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:31:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-20 08:31:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:31:23,739 INFO L225 Difference]: With dead ends: 787 [2024-11-20 08:31:23,739 INFO L226 Difference]: Without dead ends: 395 [2024-11-20 08:31:23,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:31:23,741 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:31:23,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:31:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-20 08:31:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-20 08:31:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 350 states have (on average 1.4114285714285715) internal successors, (494), 354 states have internal predecessors, (494), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:31:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 574 transitions. [2024-11-20 08:31:23,776 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 574 transitions. Word has length 140 [2024-11-20 08:31:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:31:23,776 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 574 transitions. [2024-11-20 08:31:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 08:31:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 574 transitions. [2024-11-20 08:31:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:31:23,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:31:23,779 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:31:23,791 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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:31:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:23,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:31:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:31:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -839067348, now seen corresponding path program 1 times [2024-11-20 08:31:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:31:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22726890] [2024-11-20 08:31:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:31:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:31:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:31:23,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:31:23,991 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