./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:33:01,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:33:01,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:33:01,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:33:01,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:33:01,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:33:01,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:33:01,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:33:01,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:33:01,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:33:01,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:33:01,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:33:01,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:33:01,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:33:01,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:33:01,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:33:01,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:33:01,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:33:01,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:33:01,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:33:01,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:33:01,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:33:01,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:33:01,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:33:01,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:33:01,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:33:01,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:33:01,792 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:33:01,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:33:01,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:33:01,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:33:01,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:33:01,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:01,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:33:01,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:33:01,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:33:01,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:33:01,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:33:01,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:33:01,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:33:01,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:33:01,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:33:01,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-19 00:33:02,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:33:02,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:33:02,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:33:02,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:33:02,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:33:02,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:03,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:33:03,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:33:03,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:03,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97eef9f06/085898215ab345098d94b08f4eeb74da/FLAG106597c1a [2024-11-19 00:33:03,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97eef9f06/085898215ab345098d94b08f4eeb74da [2024-11-19 00:33:03,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:33:03,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:33:03,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:03,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:33:03,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:33:03,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:03" (1/1) ... [2024-11-19 00:33:03,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283c8f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:03, skipping insertion in model container [2024-11-19 00:33:03,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:03" (1/1) ... [2024-11-19 00:33:03,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:33:03,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-19 00:33:04,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:04,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:33:04,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-19 00:33:04,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:04,224 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:33:04,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04 WrapperNode [2024-11-19 00:33:04,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:04,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:04,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:33:04,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:33:04,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,300 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2024-11-19 00:33:04,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:04,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:33:04,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:33:04,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:33:04,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,351 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-19 00:33:04,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:33:04,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:33:04,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:33:04,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:33:04,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (1/1) ... [2024-11-19 00:33:04,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:04,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:04,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:33:04,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:33:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:33:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:33:04,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:33:04,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:33:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:33:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:33:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:33:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:33:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:33:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:33:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:33:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:33:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:33:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:33:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:33:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:33:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:33:04,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:33:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:33:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:33:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:33:04,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:33:04,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:33:04,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:33:04,657 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:33:04,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:33:05,130 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-19 00:33:05,130 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:33:05,146 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:33:05,148 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:33:05,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:05 BoogieIcfgContainer [2024-11-19 00:33:05,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:33:05,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:33:05,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:33:05,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:33:05,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:33:03" (1/3) ... [2024-11-19 00:33:05,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220174f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:05, skipping insertion in model container [2024-11-19 00:33:05,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:04" (2/3) ... [2024-11-19 00:33:05,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220174f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:05, skipping insertion in model container [2024-11-19 00:33:05,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:05" (3/3) ... [2024-11-19 00:33:05,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:05,173 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:33:05,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:33:05,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:33:05,238 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;@1241a23f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:33:05,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:33:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:05,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:05,259 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:05,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:05,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1186593926, now seen corresponding path program 1 times [2024-11-19 00:33:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:05,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144941636] [2024-11-19 00:33:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:33:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144941636] [2024-11-19 00:33:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144941636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198485879] [2024-11-19 00:33:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:05,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:05,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:33:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:05,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:33:05,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:33:06,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198485879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:06,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:33:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692684097] [2024-11-19 00:33:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:06,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:33:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:33:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:06,103 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:06,179 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-19 00:33:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:33:06,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:06,201 INFO L225 Difference]: With dead ends: 241 [2024-11-19 00:33:06,202 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 00:33:06,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:06,213 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:06,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 00:33:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 00:33:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-19 00:33:06,265 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-19 00:33:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:06,266 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-19 00:33:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-19 00:33:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:06,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:06,271 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:06,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:33:06,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:33:06,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:06,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1867100974, now seen corresponding path program 1 times [2024-11-19 00:33:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669211824] [2024-11-19 00:33:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669211824] [2024-11-19 00:33:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669211824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:06,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:06,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:33:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423855160] [2024-11-19 00:33:06,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:06,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:33:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:33:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:06,864 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:06,921 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-19 00:33:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:33:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:06,923 INFO L225 Difference]: With dead ends: 239 [2024-11-19 00:33:06,923 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 00:33:06,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:06,928 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:06,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 00:33:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 00:33:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-19 00:33:06,952 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-19 00:33:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-19 00:33:06,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-19 00:33:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:06,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:06,957 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:33:06,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash -24625260, now seen corresponding path program 1 times [2024-11-19 00:33:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967590524] [2024-11-19 00:33:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967590524] [2024-11-19 00:33:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967590524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:33:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094879950] [2024-11-19 00:33:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:33:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:08,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:33:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:33:08,946 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:09,811 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2024-11-19 00:33:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:33:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:09,815 INFO L225 Difference]: With dead ends: 463 [2024-11-19 00:33:09,816 INFO L226 Difference]: Without dead ends: 344 [2024-11-19 00:33:09,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:33:09,818 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 380 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:09,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1822 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:33:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-19 00:33:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 243. [2024-11-19 00:33:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 202 states have (on average 1.400990099009901) internal successors, (283), 203 states have internal predecessors, (283), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:33:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 359 transitions. [2024-11-19 00:33:09,860 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 359 transitions. Word has length 165 [2024-11-19 00:33:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 359 transitions. [2024-11-19 00:33:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 359 transitions. [2024-11-19 00:33:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:09,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:09,871 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:33:09,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -611431274, now seen corresponding path program 1 times [2024-11-19 00:33:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984964818] [2024-11-19 00:33:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984964818] [2024-11-19 00:33:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984964818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:11,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:11,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:33:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354020127] [2024-11-19 00:33:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:33:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:33:11,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:11,315 INFO L87 Difference]: Start difference. First operand 243 states and 359 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:12,263 INFO L93 Difference]: Finished difference Result 646 states and 947 transitions. [2024-11-19 00:33:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:33:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-19 00:33:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:12,272 INFO L225 Difference]: With dead ends: 646 [2024-11-19 00:33:12,274 INFO L226 Difference]: Without dead ends: 406 [2024-11-19 00:33:12,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:12,279 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 363 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:12,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1108 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:33:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-19 00:33:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 311. [2024-11-19 00:33:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 252 states have (on average 1.373015873015873) internal successors, (346), 254 states have internal predecessors, (346), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 00:33:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2024-11-19 00:33:12,340 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 165 [2024-11-19 00:33:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:12,341 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2024-11-19 00:33:12,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2024-11-19 00:33:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:12,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:12,345 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:12,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:33:12,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -842273710, now seen corresponding path program 1 times [2024-11-19 00:33:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895320497] [2024-11-19 00:33:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:13,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895320497] [2024-11-19 00:33:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895320497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:33:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270439656] [2024-11-19 00:33:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:33:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:33:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:13,584 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:14,308 INFO L93 Difference]: Finished difference Result 563 states and 820 transitions. [2024-11-19 00:33:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:33:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:14,312 INFO L225 Difference]: With dead ends: 563 [2024-11-19 00:33:14,312 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 00:33:14,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:33:14,314 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 260 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:14,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1503 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:33:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 00:33:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 300. [2024-11-19 00:33:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 241 states have (on average 1.3651452282157677) internal successors, (329), 243 states have internal predecessors, (329), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 00:33:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 437 transitions. [2024-11-19 00:33:14,358 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 437 transitions. Word has length 165 [2024-11-19 00:33:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:14,358 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 437 transitions. [2024-11-19 00:33:14,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 437 transitions. [2024-11-19 00:33:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:14,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:14,360 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:33:14,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:14,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -158638766, now seen corresponding path program 1 times [2024-11-19 00:33:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128132484] [2024-11-19 00:33:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:15,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128132484] [2024-11-19 00:33:15,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128132484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:15,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:33:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476440642] [2024-11-19 00:33:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:15,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:33:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:33:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:15,373 INFO L87 Difference]: Start difference. First operand 300 states and 437 transitions. Second operand has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:15,799 INFO L93 Difference]: Finished difference Result 540 states and 782 transitions. [2024-11-19 00:33:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:33:15,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-19 00:33:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:15,802 INFO L225 Difference]: With dead ends: 540 [2024-11-19 00:33:15,802 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 00:33:15,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:15,803 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 143 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:15,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1292 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:33:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 00:33:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 240. [2024-11-19 00:33:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.365482233502538) internal successors, (269), 198 states have internal predecessors, (269), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:33:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2024-11-19 00:33:15,842 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 345 transitions. Word has length 165 [2024-11-19 00:33:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 345 transitions. [2024-11-19 00:33:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 345 transitions. [2024-11-19 00:33:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:15,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:15,845 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:33:15,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash -745444780, now seen corresponding path program 1 times [2024-11-19 00:33:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703942039] [2024-11-19 00:33:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703942039] [2024-11-19 00:33:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703942039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:17,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:17,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:33:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381767535] [2024-11-19 00:33:17,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:17,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:33:17,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:33:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:17,068 INFO L87 Difference]: Start difference. First operand 240 states and 345 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:17,735 INFO L93 Difference]: Finished difference Result 544 states and 783 transitions. [2024-11-19 00:33:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:33:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-19 00:33:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:17,738 INFO L225 Difference]: With dead ends: 544 [2024-11-19 00:33:17,738 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 00:33:17,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:33:17,740 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 142 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:17,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1944 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:33:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 00:33:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 240. [2024-11-19 00:33:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 198 states have internal predecessors, (268), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:33:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2024-11-19 00:33:17,773 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 165 [2024-11-19 00:33:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2024-11-19 00:33:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:33:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2024-11-19 00:33:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 00:33:17,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:17,776 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:17,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:33:17,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:17,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash -464003610, now seen corresponding path program 1 times [2024-11-19 00:33:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491941085] [2024-11-19 00:33:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:17,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:33:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491941085] [2024-11-19 00:33:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491941085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321857191] [2024-11-19 00:33:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:17,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:17,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:17,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:33:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:18,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:33:18,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:18,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321857191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:18,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:33:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588713106] [2024-11-19 00:33:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:18,283 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:18,342 INFO L93 Difference]: Finished difference Result 483 states and 693 transitions. [2024-11-19 00:33:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-19 00:33:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:18,344 INFO L225 Difference]: With dead ends: 483 [2024-11-19 00:33:18,344 INFO L226 Difference]: Without dead ends: 246 [2024-11-19 00:33:18,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:18,346 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:18,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-19 00:33:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-19 00:33:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 204 states have internal predecessors, (274), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:33:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 350 transitions. [2024-11-19 00:33:18,384 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 350 transitions. Word has length 167 [2024-11-19 00:33:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:18,384 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 350 transitions. [2024-11-19 00:33:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 350 transitions. [2024-11-19 00:33:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 00:33:18,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:18,386 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:18,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:33:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 00:33:18,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1317282817, now seen corresponding path program 1 times [2024-11-19 00:33:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:18,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044327299] [2024-11-19 00:33:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044327299] [2024-11-19 00:33:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044327299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:33:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894452264] [2024-11-19 00:33:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:33:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:33:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:19,556 INFO L87 Difference]: Start difference. First operand 246 states and 350 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:20,024 INFO L93 Difference]: Finished difference Result 720 states and 1025 transitions. [2024-11-19 00:33:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:33:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-19 00:33:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:20,027 INFO L225 Difference]: With dead ends: 720 [2024-11-19 00:33:20,027 INFO L226 Difference]: Without dead ends: 477 [2024-11-19 00:33:20,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:33:20,030 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 144 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:20,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1212 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:33:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-19 00:33:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 279. [2024-11-19 00:33:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 236 states have (on average 1.3601694915254237) internal successors, (321), 237 states have internal predecessors, (321), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:33:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 397 transitions. [2024-11-19 00:33:20,076 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 397 transitions. Word has length 169 [2024-11-19 00:33:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 397 transitions. [2024-11-19 00:33:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 397 transitions. [2024-11-19 00:33:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 00:33:20,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:20,081 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:33:20,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:20,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash 924255807, now seen corresponding path program 1 times [2024-11-19 00:33:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986024847] [2024-11-19 00:33:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986024847] [2024-11-19 00:33:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986024847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:33:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213141255] [2024-11-19 00:33:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:33:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:33:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:33:22,267 INFO L87 Difference]: Start difference. First operand 279 states and 397 transitions. Second operand has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-19 00:33:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:23,399 INFO L93 Difference]: Finished difference Result 735 states and 1044 transitions. [2024-11-19 00:33:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:33:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) Word has length 169 [2024-11-19 00:33:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:23,403 INFO L225 Difference]: With dead ends: 735 [2024-11-19 00:33:23,403 INFO L226 Difference]: Without dead ends: 459 [2024-11-19 00:33:23,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:33:23,404 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 265 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:23,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1903 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:33:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-19 00:33:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2024-11-19 00:33:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 311 states have internal predecessors, (420), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:33:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 516 transitions. [2024-11-19 00:33:23,454 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 516 transitions. Word has length 169 [2024-11-19 00:33:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 516 transitions. [2024-11-19 00:33:23,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-19 00:33:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 516 transitions. [2024-11-19 00:33:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 00:33:23,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:23,457 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:23,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:33:23,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 144835179, now seen corresponding path program 1 times [2024-11-19 00:33:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448513170] [2024-11-19 00:33:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:33:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:24,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448513170] [2024-11-19 00:33:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448513170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:24,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220431274] [2024-11-19 00:33:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:24,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:24,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:33:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:24,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:33:24,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-11-19 00:33:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-19 00:33:24,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:33:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:33:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220431274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:33:25,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:33:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-19 00:33:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494327739] [2024-11-19 00:33:25,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:33:25,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:33:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:33:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:33:25,093 INFO L87 Difference]: Start difference. First operand 363 states and 516 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-19 00:33:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:25,948 INFO L93 Difference]: Finished difference Result 1135 states and 1588 transitions. [2024-11-19 00:33:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:33:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 169 [2024-11-19 00:33:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:25,954 INFO L225 Difference]: With dead ends: 1135 [2024-11-19 00:33:25,955 INFO L226 Difference]: Without dead ends: 775 [2024-11-19 00:33:25,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:33:25,959 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 548 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:25,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1740 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:33:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-19 00:33:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 383. [2024-11-19 00:33:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 326 states have (on average 1.3404907975460123) internal successors, (437), 328 states have internal predecessors, (437), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:33:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 533 transitions. [2024-11-19 00:33:26,014 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 533 transitions. Word has length 169 [2024-11-19 00:33:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:26,015 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 533 transitions. [2024-11-19 00:33:26,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-19 00:33:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 533 transitions. [2024-11-19 00:33:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 00:33:26,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:26,017 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:26,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:33:26,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:26,218 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:26,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash 567537005, now seen corresponding path program 1 times [2024-11-19 00:33:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:26,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939320013] [2024-11-19 00:33:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939320013] [2024-11-19 00:33:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939320013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:33:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422373333] [2024-11-19 00:33:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:33:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:26,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:33:26,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:26,293 INFO L87 Difference]: Start difference. First operand 383 states and 533 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:26,353 INFO L93 Difference]: Finished difference Result 767 states and 1071 transitions. [2024-11-19 00:33:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:33:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-19 00:33:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:26,356 INFO L225 Difference]: With dead ends: 767 [2024-11-19 00:33:26,356 INFO L226 Difference]: Without dead ends: 387 [2024-11-19 00:33:26,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:26,358 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:26,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-19 00:33:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-19 00:33:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 330 states have (on average 1.3363636363636364) internal successors, (441), 332 states have internal predecessors, (441), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:33:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 537 transitions. [2024-11-19 00:33:26,419 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 537 transitions. Word has length 169 [2024-11-19 00:33:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 537 transitions. [2024-11-19 00:33:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 537 transitions. [2024-11-19 00:33:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 00:33:26,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:26,422 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:33:26,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash 786391723, now seen corresponding path program 1 times [2024-11-19 00:33:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283439810] [2024-11-19 00:33:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:33:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516640637] [2024-11-19 00:33:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:26,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:33:26,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:33:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:33:27,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:33:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:33:27,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:33:27,287 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:33:27,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:33:27,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:33:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:27,494 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:27,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:33:27,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:33:27 BoogieIcfgContainer [2024-11-19 00:33:27,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:33:27,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:33:27,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:33:27,592 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:33:27,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:05" (3/4) ... [2024-11-19 00:33:27,594 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:33:27,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:33:27,596 INFO L158 Benchmark]: Toolchain (without parser) took 23839.61ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 108.5MB in the beginning and 632.4MB in the end (delta: -523.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:33:27,596 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 180.4MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:33:27,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.02ms. Allocated memory is still 180.4MB. Free memory was 108.3MB in the beginning and 145.2MB in the end (delta: -36.9MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-19 00:33:27,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.12ms. Allocated memory is still 180.4MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:33:27,597 INFO L158 Benchmark]: Boogie Preprocessor took 103.69ms. Allocated memory is still 180.4MB. Free memory was 141.0MB in the beginning and 135.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:33:27,597 INFO L158 Benchmark]: RCFGBuilder took 741.86ms. Allocated memory is still 180.4MB. Free memory was 135.8MB in the beginning and 100.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:33:27,598 INFO L158 Benchmark]: TraceAbstraction took 22438.89ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 99.1MB in the beginning and 632.4MB in the end (delta: -533.3MB). Peak memory consumption was 375.1MB. Max. memory is 16.1GB. [2024-11-19 00:33:27,599 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 696.3MB. Free memory is still 632.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:33:27,600 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.21ms. Allocated memory is still 180.4MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.02ms. Allocated memory is still 180.4MB. Free memory was 108.3MB in the beginning and 145.2MB in the end (delta: -36.9MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.12ms. Allocated memory is still 180.4MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.69ms. Allocated memory is still 180.4MB. Free memory was 141.0MB in the beginning and 135.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 741.86ms. Allocated memory is still 180.4MB. Free memory was 135.8MB in the beginning and 100.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22438.89ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 99.1MB in the beginning and 632.4MB in the end (delta: -533.3MB). Peak memory consumption was 375.1MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 696.3MB. Free memory is still 632.4MB. 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 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L54] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L55] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L57] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L58] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[3] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR float_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L69] float_Array_0[4] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L71] unsigned_long_int_Array_0[0][0][0] = __VERIFIER_nondet_ulong() [L72] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L74] unsigned_long_int_Array_0[1][0][0] = __VERIFIER_nondet_ulong() [L75] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L77] unsigned_long_int_Array_0[1][1][0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L80] unsigned_long_int_Array_0[1][0][1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L83] unsigned_long_int_Array_0[0][1][1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L98] RET updateVariables() [L99] CALL step() [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] unsigned_long_int_Array_0[1][1][1] = ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))) [L35] EXPR float_Array_0[4] [L35] EXPR float_Array_0[3] [L35] EXPR float_Array_0[2] [L35] EXPR float_Array_0[1] [L35] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L35] COND FALSE !((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR unsigned_long_int_Array_0[1][1][0] [L38] EXPR unsigned_long_int_Array_0[0][0][0] [L38] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] unsigned_long_int_Array_0[0][1][0] = ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))) [L39] EXPR float_Array_0[4] [L39] unsigned char stepLocal_0 = (- float_Array_0[4]) != 1.9f; [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) [L40] EXPR unsigned_long_int_Array_0[0][0][1] [L40] EXPR unsigned_long_int_Array_0[1][0][0] [L40] EXPR unsigned_long_int_Array_0[1][0][1] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] COND FALSE !(stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) [L43] EXPR BOOL_unsigned_char_Array_0[1][1] [L43] BOOL_unsigned_char_Array_0[0][1] = BOOL_unsigned_char_Array_0[1][1] [L45] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR unsigned_long_int_Array_0[1][1][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) [L90] EXPR float_Array_0[4] [L90] EXPR float_Array_0[3] [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 [L90] EXPR unsigned_long_int_Array_0[0][0][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90-L91] return ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2299 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2245 mSDsluCounter, 14225 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11636 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4692 IncrementalHoareTripleChecker+Invalid, 4953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 2589 mSDtfsCounter, 4692 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 731 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=12, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1035 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 2837 NumberOfCodeBlocks, 2837 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2652 ConstructedInterpolants, 0 QuantifiedInterpolants, 8483 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 11927/12160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:33:27,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:33:29,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:33:29,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:33:29,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:33:29,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:33:29,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:33:29,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:33:29,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:33:29,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:33:29,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:33:29,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:33:29,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:33:29,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:33:29,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:33:29,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:33:29,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:33:29,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:33:29,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:33:29,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:33:29,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:33:29,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:33:29,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:33:29,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:33:29,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:33:29,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:33:29,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:33:29,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:33:29,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:33:29,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:33:29,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:33:29,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:33:29,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:33:29,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:33:29,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:33:29,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:29,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:33:29,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:33:29,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:33:29,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:33:29,974 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:33:29,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:33:29,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:33:29,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:33:29,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:33:29,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-19 00:33:30,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:33:30,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:33:30,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:33:30,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:33:30,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:33:30,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:31,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:33:32,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:33:32,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:32,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efaf280a3/ea54db82d1684a84a16414cbc2c71cb7/FLAGd47419daa [2024-11-19 00:33:32,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efaf280a3/ea54db82d1684a84a16414cbc2c71cb7 [2024-11-19 00:33:32,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:33:32,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:33:32,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:32,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:33:32,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:33:32,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d795d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32, skipping insertion in model container [2024-11-19 00:33:32,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:33:32,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-19 00:33:32,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:32,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:33:32,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-19 00:33:32,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:32,644 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:33:32,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32 WrapperNode [2024-11-19 00:33:32,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:32,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:32,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:33:32,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:33:32,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,720 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2024-11-19 00:33:32,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:32,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:33:32,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:33:32,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:33:32,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,776 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-19 00:33:32,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:33:32,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:33:32,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:33:32,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:33:32,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (1/1) ... [2024-11-19 00:33:32,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:32,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:33:32,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:33:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:33:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:33:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:33:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:33:32,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:33:32,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:33:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:33:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:33:33,068 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:33:33,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:33:46,919 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-19 00:33:46,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:33:46,936 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:33:46,936 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:33:46,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:46 BoogieIcfgContainer [2024-11-19 00:33:46,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:33:46,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:33:46,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:33:46,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:33:46,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:33:32" (1/3) ... [2024-11-19 00:33:46,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5deaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:46, skipping insertion in model container [2024-11-19 00:33:46,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:32" (2/3) ... [2024-11-19 00:33:46,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5deaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:46, skipping insertion in model container [2024-11-19 00:33:46,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:46" (3/3) ... [2024-11-19 00:33:46,948 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-19 00:33:46,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:33:46,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:33:47,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:33:47,038 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;@47a77794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:33:47,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:33:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:47,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:47,059 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:47,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1186593926, now seen corresponding path program 1 times [2024-11-19 00:33:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:33:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294339263] [2024-11-19 00:33:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:33:47,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:33:47,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:33:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:47,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:33:47,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-19 00:33:47,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:47,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:33:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294339263] [2024-11-19 00:33:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294339263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:33:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334266677] [2024-11-19 00:33:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:33:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:33:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:33:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:47,731 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:47,759 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-19 00:33:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:33:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:47,767 INFO L225 Difference]: With dead ends: 241 [2024-11-19 00:33:47,767 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 00:33:47,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:33:47,773 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:47,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 00:33:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 00:33:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-19 00:33:47,813 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-19 00:33:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:47,813 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-19 00:33:47,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-19 00:33:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:47,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:47,817 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:47,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:33:48,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:48,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1867100974, now seen corresponding path program 1 times [2024-11-19 00:33:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:33:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621868673] [2024-11-19 00:33:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:33:48,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:33:48,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:33:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:48,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:33:48,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-19 00:33:48,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:48,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:33:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621868673] [2024-11-19 00:33:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621868673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:48,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:33:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981275527] [2024-11-19 00:33:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:48,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:33:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:33:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:33:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:48,580 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:48,691 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-19 00:33:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:33:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:33:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:48,693 INFO L225 Difference]: With dead ends: 239 [2024-11-19 00:33:48,693 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 00:33:48,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:33:48,697 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:48,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 00:33:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 00:33:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:33:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-19 00:33:48,715 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-19 00:33:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:48,717 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-19 00:33:48,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:33:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-19 00:33:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:48,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:48,720 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:48,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:33:48,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:48,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -24625260, now seen corresponding path program 1 times [2024-11-19 00:33:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:33:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128680497] [2024-11-19 00:33:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:33:48,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:33:48,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:33:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:49,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:33:49,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:50,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-11-19 00:33:50,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:33:50,742 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 32 treesize of output 14 [2024-11-19 00:33:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-19 00:33:50,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:33:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:33:51,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:33:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128680497] [2024-11-19 00:33:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128680497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:33:51,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:33:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-19 00:33:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247802766] [2024-11-19 00:33:51,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:33:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:33:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:33:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:33:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:33:51,966 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-19 00:33:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:56,677 INFO L93 Difference]: Finished difference Result 380 states and 545 transitions. [2024-11-19 00:33:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 00:33:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 165 [2024-11-19 00:33:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:56,682 INFO L225 Difference]: With dead ends: 380 [2024-11-19 00:33:56,686 INFO L226 Difference]: Without dead ends: 261 [2024-11-19 00:33:56,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2024-11-19 00:33:56,688 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 229 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:56,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1829 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 00:33:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-19 00:33:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2024-11-19 00:33:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 194 states have internal predecessors, (262), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:33:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 342 transitions. [2024-11-19 00:33:56,733 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 342 transitions. Word has length 165 [2024-11-19 00:33:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 342 transitions. [2024-11-19 00:33:56,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-19 00:33:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 342 transitions. [2024-11-19 00:33:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:56,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:56,742 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:56,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:33:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:56,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1612973162, now seen corresponding path program 1 times [2024-11-19 00:33:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:33:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141521290] [2024-11-19 00:33:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:33:56,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:33:56,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:33:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:57,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:33:57,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-19 00:33:57,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:57,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:33:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141521290] [2024-11-19 00:33:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141521290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:33:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990775725] [2024-11-19 00:33:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:33:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:33:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:33:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:57,439 INFO L87 Difference]: Start difference. First operand 239 states and 342 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:57,491 INFO L93 Difference]: Finished difference Result 476 states and 683 transitions. [2024-11-19 00:33:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:33:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-19 00:33:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:57,497 INFO L225 Difference]: With dead ends: 476 [2024-11-19 00:33:57,498 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 00:33:57,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:33:57,501 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:57,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 00:33:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-19 00:33:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 195 states have internal predecessors, (263), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:33:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 343 transitions. [2024-11-19 00:33:57,532 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 343 transitions. Word has length 165 [2024-11-19 00:33:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:57,533 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 343 transitions. [2024-11-19 00:33:57,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:33:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 343 transitions. [2024-11-19 00:33:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 00:33:57,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:57,537 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:57,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:33:57,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:57,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash 687849428, now seen corresponding path program 1 times [2024-11-19 00:33:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:33:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754573997] [2024-11-19 00:33:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:57,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:33:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:33:57,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:33:57,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:33:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:58,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:33:58,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:58,381 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-11-19 00:33:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-11-19 00:33:58,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:58,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:33:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754573997] [2024-11-19 00:33:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754573997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:58,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:58,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:33:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63137061] [2024-11-19 00:33:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:33:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:58,443 INFO L87 Difference]: Start difference. First operand 240 states and 343 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:34:00,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:03,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:05,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:07,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:09,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:11,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:12,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:12,873 INFO L93 Difference]: Finished difference Result 479 states and 685 transitions. [2024-11-19 00:34:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:12,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-19 00:34:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:12,902 INFO L225 Difference]: With dead ends: 479 [2024-11-19 00:34:12,902 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 00:34:12,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:12,904 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 156 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:12,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 522 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-11-19 00:34:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 00:34:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-11-19 00:34:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 195 states have internal predecessors, (261), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:34:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 341 transitions. [2024-11-19 00:34:12,931 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 341 transitions. Word has length 165 [2024-11-19 00:34:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:12,931 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 341 transitions. [2024-11-19 00:34:12,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:34:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 341 transitions. [2024-11-19 00:34:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 00:34:12,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:12,934 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:12,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:34:13,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:13,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1338205264, now seen corresponding path program 1 times [2024-11-19 00:34:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236333639] [2024-11-19 00:34:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:13,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:34:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:13,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:34:13,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-19 00:34:13,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:13,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236333639] [2024-11-19 00:34:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236333639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567401605] [2024-11-19 00:34:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:13,678 INFO L87 Difference]: Start difference. First operand 240 states and 341 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:34:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:14,130 INFO L93 Difference]: Finished difference Result 489 states and 693 transitions. [2024-11-19 00:34:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-19 00:34:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:14,133 INFO L225 Difference]: With dead ends: 489 [2024-11-19 00:34:14,133 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 00:34:14,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:14,134 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:14,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 711 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:34:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 00:34:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2024-11-19 00:34:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3350515463917525) internal successors, (259), 195 states have internal predecessors, (259), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:34:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 339 transitions. [2024-11-19 00:34:14,164 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 339 transitions. Word has length 167 [2024-11-19 00:34:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:14,164 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 339 transitions. [2024-11-19 00:34:14,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 00:34:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 339 transitions. [2024-11-19 00:34:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 00:34:14,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:14,167 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:14,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:34:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:14,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -60748338, now seen corresponding path program 1 times [2024-11-19 00:34:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618191644] [2024-11-19 00:34:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:14,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:14,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:14,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:14,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:34:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:14,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:34:14,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:15,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 00:34:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-19 00:34:15,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:15,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618191644] [2024-11-19 00:34:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618191644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859557414] [2024-11-19 00:34:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:15,230 INFO L87 Difference]: Start difference. First operand 240 states and 339 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:34:18,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []