./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-p_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:41:12,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:41:12,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:41:12,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:41:12,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:41:12,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:41:12,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:41:12,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:41:12,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:41:12,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:41:12,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:41:12,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:41:12,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:41:12,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:41:12,403 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:41:12,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:41:12,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:41:12,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:41:12,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:41:12,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:41:12,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:41:12,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:41:12,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:41:12,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:41:12,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:41:12,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:41:12,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:41:12,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:41:12,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:41:12,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:41:12,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:41:12,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:41:12,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:12,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:41:12,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:41:12,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:41:12,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:41:12,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:41:12,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:41:12,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:41:12,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:41:12,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:41:12,410 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-clean/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-clean/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 -> c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd [2024-10-11 13:41:12,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:41:12,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:41:12,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:41:12,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:41:12,702 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:41:12,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:14,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:41:14,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:41:14,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:14,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d8f4829d/9ee23ccf237b488ba19c061b1932ae3e/FLAGd69b9510a [2024-10-11 13:41:14,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d8f4829d/9ee23ccf237b488ba19c061b1932ae3e [2024-10-11 13:41:14,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:41:14,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:41:14,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:14,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:41:14,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:41:14,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391cce91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14, skipping insertion in model container [2024-10-11 13:41:14,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:41:14,595 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-10-11 13:41:14,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:14,664 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:41:14,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-10-11 13:41:14,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:14,721 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:41:14,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14 WrapperNode [2024-10-11 13:41:14,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:14,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:14,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:41:14,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:41:14,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,781 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-10-11 13:41:14,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:14,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:41:14,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:41:14,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:41:14,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,851 INFO L175 MemorySlicer]: Split 122 memory accesses to 11 slices as follows [2, 13, 8, 14, 20, 12, 10, 11, 8, 16, 8]. 16 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 3]. [2024-10-11 13:41:14,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:41:14,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:41:14,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:41:14,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:41:14,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (1/1) ... [2024-10-11 13:41:14,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:41:14,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:41:14,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:41:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:41:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:41:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:41:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:41:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:41:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:41:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:41:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:41:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:41:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:41:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:41:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:41:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:41:15,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:41:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:41:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:41:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:41:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:41:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:41:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:41:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:41:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:41:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:41:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:41:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:41:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:41:15,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:41:15,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:41:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:41:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:41:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:41:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:41:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:41:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:41:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:41:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:41:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:41:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:41:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:41:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:41:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:41:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:41:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:41:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:41:15,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:41:15,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:41:15,724 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-11 13:41:15,724 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:41:15,763 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:41:15,763 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:41:15,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:15 BoogieIcfgContainer [2024-10-11 13:41:15,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:41:15,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:41:15,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:41:15,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:41:15,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:41:14" (1/3) ... [2024-10-11 13:41:15,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddff84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:15, skipping insertion in model container [2024-10-11 13:41:15,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:14" (2/3) ... [2024-10-11 13:41:15,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddff84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:15, skipping insertion in model container [2024-10-11 13:41:15,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:15" (3/3) ... [2024-10-11 13:41:15,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:15,791 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:41:15,791 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:41:15,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:41:15,858 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;@1d50c87d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:41:15,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:41:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:15,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:15,894 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:15,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:15,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:15,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767643, now seen corresponding path program 1 times [2024-10-11 13:41:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992686246] [2024-10-11 13:41:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:41:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:41:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:41:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:41:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:41:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:41:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992686246] [2024-10-11 13:41:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992686246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:41:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509479874] [2024-10-11 13:41:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:16,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:41:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:41:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:16,365 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:16,425 INFO L93 Difference]: Finished difference Result 183 states and 294 transitions. [2024-10-11 13:41:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:41:16,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 13:41:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:16,436 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:41:16,436 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:41:16,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:16,443 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:16,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:41:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:41:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 13:41:16,480 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 98 [2024-10-11 13:41:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:16,481 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 13:41:16,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 13:41:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:16,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:16,485 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:41:16,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1312194037, now seen corresponding path program 1 times [2024-10-11 13:41:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039714155] [2024-10-11 13:41:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:41:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:41:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:41:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:41:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:41:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:41:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039714155] [2024-10-11 13:41:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039714155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:41:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682095756] [2024-10-11 13:41:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:41:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:16,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:41:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:16,749 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:16,800 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-11 13:41:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:41:16,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 13:41:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:16,805 INFO L225 Difference]: With dead ends: 182 [2024-10-11 13:41:16,807 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 13:41:16,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:16,809 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:16,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 13:41:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 13:41:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 13:41:16,822 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 98 [2024-10-11 13:41:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 13:41:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 13:41:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:16,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:16,826 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:41:16,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1899000051, now seen corresponding path program 1 times [2024-10-11 13:41:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528193637] [2024-10-11 13:41:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:41:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:41:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:41:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:41:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:41:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:41:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528193637] [2024-10-11 13:41:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528193637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:41:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946439340] [2024-10-11 13:41:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:18,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:41:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:41:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:41:18,080 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:18,436 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2024-10-11 13:41:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:41:18,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 98 [2024-10-11 13:41:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:18,440 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:41:18,440 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:41:18,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:41:18,442 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 306 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:18,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 539 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:41:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:41:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-11 13:41:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:41:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-10-11 13:41:18,457 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 98 [2024-10-11 13:41:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:18,458 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-10-11 13:41:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-10-11 13:41:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:41:18,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:18,460 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:18,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:41:18,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1401421324, now seen corresponding path program 1 times [2024-10-11 13:41:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191519934] [2024-10-11 13:41:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:41:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:41:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:41:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:41:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:41:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:41:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191519934] [2024-10-11 13:41:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191519934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:41:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836720254] [2024-10-11 13:41:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:41:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:41:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:41:19,290 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:19,601 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2024-10-11 13:41:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:41:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2024-10-11 13:41:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:19,603 INFO L225 Difference]: With dead ends: 210 [2024-10-11 13:41:19,603 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:41:19,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:41:19,605 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 302 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:19,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 701 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:41:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:41:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-10-11 13:41:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 94 states have internal predecessors, (130), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:41:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-11 13:41:19,632 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 100 [2024-10-11 13:41:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-11 13:41:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-11 13:41:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 13:41:19,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:19,638 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:41:19,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1210731769, now seen corresponding path program 1 times [2024-10-11 13:41:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229987033] [2024-10-11 13:41:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:41:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425218044] [2024-10-11 13:41:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:41:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:41:19,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:41:19,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:41:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:41:19,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:41:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:41:20,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:41:20,250 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:41:20,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:41:20,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:41:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:41:20,456 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 13:41:20,622 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:41:20,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:41:20 BoogieIcfgContainer [2024-10-11 13:41:20,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:41:20,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:41:20,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:41:20,628 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:41:20,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:15" (3/4) ... [2024-10-11 13:41:20,631 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:41:20,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:41:20,633 INFO L158 Benchmark]: Toolchain (without parser) took 6221.15ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 124.9MB in the beginning and 118.5MB in the end (delta: 6.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-10-11 13:41:20,633 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:41:20,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.26ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 109.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:41:20,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.10ms. Allocated memory is still 169.9MB. Free memory was 109.5MB in the beginning and 105.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:41:20,634 INFO L158 Benchmark]: Boogie Preprocessor took 116.26ms. Allocated memory is still 169.9MB. Free memory was 105.3MB in the beginning and 99.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:41:20,635 INFO L158 Benchmark]: RCFGBuilder took 863.69ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 55.0MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 13:41:20,635 INFO L158 Benchmark]: TraceAbstraction took 4858.72ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 54.3MB in the beginning and 118.5MB in the end (delta: -64.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:41:20,635 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 218.1MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:41:20,640 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.19ms. Allocated memory is still 169.9MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.26ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 109.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.10ms. Allocated memory is still 169.9MB. Free memory was 109.5MB in the beginning and 105.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.26ms. Allocated memory is still 169.9MB. Free memory was 105.3MB in the beginning and 99.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 863.69ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 55.0MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4858.72ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 54.3MB in the beginning and 118.5MB in the end (delta: -64.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 218.1MB. Free memory is still 118.5MB. 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 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_3 = 8.2; [L24] float var_1_3 = 8.2; [L25] float* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 100000000000.4; [L26] float var_1_4 = 100000000000.4; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 4; [L28] unsigned char var_1_6 = 4; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] double var_1_7 = 0.2; [L30] double var_1_7 = 0.2; [L31] double* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 0; [L32] unsigned char var_1_8 = 0; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] unsigned short int var_1_9 = 32; [L34] unsigned short int var_1_9 = 32; [L35] unsigned short int* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 1; [L36] unsigned char var_1_10 = 1; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] double var_1_11 = 127.5; [L38] double var_1_11 = 127.5; [L39] double* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 5; [L40] unsigned long int var_1_12 = 5; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] double last_1_var_1_7 = 0.2; [L43] unsigned long int last_1_var_1_12 = 5; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR \read(var_1_7) [L99] last_1_var_1_7 = var_1_7 [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_float() [L79] EXPR \read(var_1_3) [L79] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F [L79] EXPR \read(var_1_3) [L79] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_4 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_4) [L81] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L81] EXPR \read(var_1_4) [L81] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_6 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_9 = __VERIFIER_nondet_ushort() [L89] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_11 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_11) [L96] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L96] EXPR \read(var_1_11) [L96] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] RET updateVariables() [L112] CALL step() [L47] EXPR \read(*var_1_3_Pointer) [L47] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L47] COND FALSE !(! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) [L54] EXPR \read(*var_1_6_Pointer) [L54] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L56] EXPR \read(*var_1_8_Pointer) [L56] (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L56] EXPR \read(*var_1_6_Pointer) [L56] EXPR \read(*var_1_9_Pointer) [L56] EXPR \read(*var_1_1_Pointer) [L56] (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) [L63] EXPR \read(*var_1_11_Pointer) [L63] (*(var_1_7_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L65] COND FALSE !((*(var_1_8_Pointer))) [L74] EXPR \read(*var_1_6_Pointer) [L74] (*(var_1_12_Pointer)) = (*(var_1_6_Pointer)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*var_1_3_Pointer) [L103] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR (! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR \read(*var_1_6_Pointer) [L103] EXPR (! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR ((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR ((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) [L103] EXPR \read(*var_1_8_Pointer) [L103] EXPR (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L103] EXPR \read(*var_1_6_Pointer) [L103] EXPR \read(*var_1_9_Pointer) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR ((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L103] EXPR \read(*var_1_7_Pointer) [L103] EXPR \read(*var_1_11_Pointer) [L103] EXPR ((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR ((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR (((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))))) && ((*(var_1_8_Pointer)) ? (((*(var_1_10_Pointer)) && ((*(var_1_4_Pointer)) <= (*(var_1_7_Pointer)))) ? (((((((*(var_1_4_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_11_Pointer))))) > (*(var_1_7_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) > ((*(var_1_9_Pointer)))) ? (((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) : 1) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR (((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))))) && ((*(var_1_8_Pointer)) ? (((*(var_1_10_Pointer)) && ((*(var_1_4_Pointer)) <= (*(var_1_7_Pointer)))) ? (((((((*(var_1_4_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_11_Pointer))))) > (*(var_1_7_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) > ((*(var_1_9_Pointer)))) ? (((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) : 1) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103-L104] return (((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))))) && ((*(var_1_8_Pointer)) ? (((*(var_1_10_Pointer)) && ((*(var_1_4_Pointer)) <= (*(var_1_7_Pointer)))) ? (((((((*(var_1_4_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_11_Pointer))))) > (*(var_1_7_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) > ((*(var_1_9_Pointer)))) ? (((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) : 1) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 1620 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1097 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 523 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1056/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:41:20,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:41:22,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:41:23,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:41:23,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:41:23,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:41:23,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:41:23,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:41:23,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:41:23,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:41:23,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:41:23,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:41:23,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:41:23,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:41:23,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:41:23,058 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:41:23,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:41:23,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:41:23,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:41:23,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:41:23,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:41:23,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:41:23,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:41:23,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:41:23,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:41:23,064 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:41:23,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:41:23,064 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:41:23,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:41:23,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:41:23,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:41:23,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:41:23,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:41:23,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:41:23,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:41:23,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:23,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:41:23,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:41:23,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:41:23,068 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:41:23,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:41:23,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:41:23,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:41:23,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:41:23,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:41:23,069 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:41:23,069 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-clean/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-clean/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 -> c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd [2024-10-11 13:41:23,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:41:23,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:41:23,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:41:23,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:41:23,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:41:23,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:24,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:41:25,176 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:41:25,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:25,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b61db264/6ba4829eccda4c45af7c1d71afa4764a/FLAG8e17d549a [2024-10-11 13:41:25,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b61db264/6ba4829eccda4c45af7c1d71afa4764a [2024-10-11 13:41:25,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:41:25,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:41:25,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:25,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:41:25,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:41:25,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:25,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a821b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25, skipping insertion in model container [2024-10-11 13:41:25,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:25,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:41:25,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-10-11 13:41:25,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:25,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:41:25,905 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-10-11 13:41:25,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:25,978 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:41:25,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25 WrapperNode [2024-10-11 13:41:25,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:25,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:25,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:41:25,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:41:25,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,054 INFO L138 Inliner]: procedures = 39, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-10-11 13:41:26,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:26,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:41:26,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:41:26,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:41:26,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,113 INFO L175 MemorySlicer]: Split 122 memory accesses to 11 slices as follows [2, 13, 8, 14, 20, 12, 10, 11, 8, 16, 8]. 16 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 3]. [2024-10-11 13:41:26,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:41:26,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:41:26,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:41:26,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:41:26,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (1/1) ... [2024-10-11 13:41:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:41:26,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:41:26,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:41:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:41:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:41:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:41:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:41:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:41:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:41:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:41:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:41:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:41:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:41:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:41:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-11 13:41:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:41:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:41:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:41:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:41:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:41:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:41:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:41:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:41:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:41:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:41:26,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:41:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:41:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:41:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:41:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:41:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:41:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:41:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:41:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:41:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:41:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:41:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:41:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:41:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:41:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:41:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:41:26,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:41:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:41:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:41:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:41:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:41:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:41:26,520 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:41:26,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:41:28,375 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-11 13:41:28,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:41:28,436 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:41:28,437 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:41:28,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:28 BoogieIcfgContainer [2024-10-11 13:41:28,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:41:28,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:41:28,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:41:28,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:41:28,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:41:25" (1/3) ... [2024-10-11 13:41:28,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a3f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:28, skipping insertion in model container [2024-10-11 13:41:28,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:25" (2/3) ... [2024-10-11 13:41:28,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a3f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:28, skipping insertion in model container [2024-10-11 13:41:28,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:28" (3/3) ... [2024-10-11 13:41:28,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-7.i [2024-10-11 13:41:28,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:41:28,464 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:41:28,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:41:28,547 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;@17fd31ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:41:28,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:41:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:28,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:28,565 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:28,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767643, now seen corresponding path program 1 times [2024-10-11 13:41:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853305658] [2024-10-11 13:41:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:28,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:28,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:28,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:41:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:41:29,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-11 13:41:29,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:29,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853305658] [2024-10-11 13:41:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853305658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:29,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:29,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:41:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176934158] [2024-10-11 13:41:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:29,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:41:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:41:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:29,113 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:29,197 INFO L93 Difference]: Finished difference Result 183 states and 294 transitions. [2024-10-11 13:41:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:41:29,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 13:41:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:29,211 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:41:29,212 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:41:29,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:29,221 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:29,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:41:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:41:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 13:41:29,278 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 98 [2024-10-11 13:41:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:29,278 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 13:41:29,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 13:41:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:29,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:29,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:29,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:41:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:29,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1312194037, now seen corresponding path program 1 times [2024-10-11 13:41:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925178707] [2024-10-11 13:41:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:29,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:29,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:41:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:41:29,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:29,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:29,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925178707] [2024-10-11 13:41:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925178707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:41:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691218508] [2024-10-11 13:41:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:29,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:41:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:41:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:29,964 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:30,045 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-11 13:41:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:41:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 13:41:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:30,050 INFO L225 Difference]: With dead ends: 182 [2024-10-11 13:41:30,050 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 13:41:30,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:30,053 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:30,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 13:41:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 13:41:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 13:41:30,075 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 98 [2024-10-11 13:41:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:30,076 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 13:41:30,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 13:41:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:41:30,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:30,084 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:30,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:41:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:30,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:30,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1899000051, now seen corresponding path program 1 times [2024-10-11 13:41:30,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412199068] [2024-10-11 13:41:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:30,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:30,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:41:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:30,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:41:30,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:30,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-11 13:41:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:30,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:30,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412199068] [2024-10-11 13:41:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412199068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:30,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869255593] [2024-10-11 13:41:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:30,861 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:32,621 INFO L93 Difference]: Finished difference Result 184 states and 268 transitions. [2024-10-11 13:41:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:41:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 13:41:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:32,625 INFO L225 Difference]: With dead ends: 184 [2024-10-11 13:41:32,625 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:41:32,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:41:32,627 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 130 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:32,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 395 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:41:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:41:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 13:41:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-10-11 13:41:32,637 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 98 [2024-10-11 13:41:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:32,638 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-10-11 13:41:32,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-10-11 13:41:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:41:32,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:32,640 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:32,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:41:32,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:32,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 503507911, now seen corresponding path program 1 times [2024-10-11 13:41:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001205366] [2024-10-11 13:41:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:32,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:32,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:41:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:41:33,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:33,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-11 13:41:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:41:33,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:33,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001205366] [2024-10-11 13:41:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001205366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:33,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:33,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550330757] [2024-10-11 13:41:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:33,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:33,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:33,403 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:34,993 INFO L93 Difference]: Finished difference Result 184 states and 266 transitions. [2024-10-11 13:41:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:41:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 13:41:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:34,998 INFO L225 Difference]: With dead ends: 184 [2024-10-11 13:41:34,998 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:41:34,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:41:34,999 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:35,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 387 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 13:41:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:41:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 13:41:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-11 13:41:35,010 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 100 [2024-10-11 13:41:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:35,010 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-11 13:41:35,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-11 13:41:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:41:35,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:35,012 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:35,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:41:35,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:35,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:35,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -99255219, now seen corresponding path program 1 times [2024-10-11 13:41:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237622909] [2024-10-11 13:41:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:35,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:35,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:35,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:35,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:41:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:35,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:41:35,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:35,674 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 17 treesize of output 13 [2024-10-11 13:41:35,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-10-11 13:41:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:35,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:41:35,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:41:35,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237622909] [2024-10-11 13:41:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237622909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495160286] [2024-10-11 13:41:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:41:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:35,771 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:36,312 INFO L93 Difference]: Finished difference Result 204 states and 290 transitions. [2024-10-11 13:41:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:41:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:36,316 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:41:36,316 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:41:36,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:41:36,317 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 84 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:36,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 458 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:41:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:41:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-11 13:41:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 96 states have internal predecessors, (129), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:41:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-11 13:41:36,340 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 102 [2024-10-11 13:41:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:36,342 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-11 13:41:36,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-11 13:41:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:41:36,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:36,344 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:36,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:41:36,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:36,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:36,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1576509236, now seen corresponding path program 1 times [2024-10-11 13:41:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:41:36,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158859794] [2024-10-11 13:41:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:41:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:41:36,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:41:36,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:41:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:38,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 13:41:38,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:41:39,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:41:39,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2024-10-11 13:42:02,491 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 89 treesize of output 53 [2024-10-11 13:42:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-11 13:42:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 13:42:09,039 INFO L311 TraceCheckSpWp]: Computing backward predicates...