./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.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 cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:52:07,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:52:07,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:52:07,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:52:07,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:52:07,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:52:07,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:52:07,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:52:07,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:52:07,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:52:07,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:52:07,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:52:07,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:52:07,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:52:07,853 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:52:07,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:52:07,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:52:07,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:52:07,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:52:07,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:52:07,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:52:07,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:52:07,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:52:07,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:52:07,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:52:07,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:52:07,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:52:07,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:52:07,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:52:07,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:52:07,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:52:07,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:52:07,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:52:07,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:52:07,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:52:07,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:52:07,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:52:07,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:52:07,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:52:07,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:52:07,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:52:07,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:52:07,861 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 -> cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 [2024-11-22 12:52:08,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:52:08,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:52:08,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:52:08,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:52:08,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:52:08,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:09,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:52:09,481 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:52:09,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:09,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ba93a2f/682b9bd7cca54233a2b7bccc86ecc4a2/FLAGbea355e23 [2024-11-22 12:52:09,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ba93a2f/682b9bd7cca54233a2b7bccc86ecc4a2 [2024-11-22 12:52:09,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:52:09,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:52:09,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:52:09,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:52:09,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:52:09,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:09" (1/1) ... [2024-11-22 12:52:09,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7d9491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:09, skipping insertion in model container [2024-11-22 12:52:09,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:09" (1/1) ... [2024-11-22 12:52:09,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:52:10,048 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-p_file-13.i[916,929] [2024-11-22 12:52:10,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:52:10,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:52:10,133 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-p_file-13.i[916,929] [2024-11-22 12:52:10,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:52:10,186 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:52:10,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10 WrapperNode [2024-11-22 12:52:10,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:52:10,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:52:10,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:52:10,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:52:10,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,232 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-22 12:52:10,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:52:10,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:52:10,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:52:10,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:52:10,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,282 INFO L175 MemorySlicer]: Split 115 memory accesses to 14 slices as follows [2, 5, 8, 5, 7, 6, 5, 10, 10, 23, 8, 8, 8, 10]. 20 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-22 12:52:10,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:52:10,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:52:10,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:52:10,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:52:10,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (1/1) ... [2024-11-22 12:52:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:52:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:10,345 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-22 12:52:10,347 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-22 12:52:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:52:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:52:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:52:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:52:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:52:10,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:52:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:52:10,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-22 12:52:10,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:52:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:52:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-22 12:52:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-22 12:52:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-22 12:52:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-22 12:52:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-22 12:52:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-22 12:52:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-22 12:52:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:52:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:52:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:52:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:52:10,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:52:10,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 12:52:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 12:52:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 12:52:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-22 12:52:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-22 12:52:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-22 12:52:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-22 12:52:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:52:10,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:52:10,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:52:10,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:52:10,999 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-22 12:52:10,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:52:11,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:52:11,015 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:52:11,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:11 BoogieIcfgContainer [2024-11-22 12:52:11,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:52:11,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:52:11,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:52:11,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:52:11,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:52:09" (1/3) ... [2024-11-22 12:52:11,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a787418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:11, skipping insertion in model container [2024-11-22 12:52:11,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:10" (2/3) ... [2024-11-22 12:52:11,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a787418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:11, skipping insertion in model container [2024-11-22 12:52:11,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:11" (3/3) ... [2024-11-22 12:52:11,023 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:11,035 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:52:11,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:52:11,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:52:11,098 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;@6b5b56fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:52:11,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:52:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 12:52:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:11,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:11,115 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:11,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1910210082, now seen corresponding path program 1 times [2024-11-22 12:52:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514230182] [2024-11-22 12:52:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-22 12:52:11,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514230182] [2024-11-22 12:52:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514230182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313163590] [2024-11-22 12:52:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:11,444 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-22 12:52:11,445 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-22 12:52:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:11,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:52:11,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-22 12:52:11,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313163590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:11,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:52:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201903802] [2024-11-22 12:52:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:11,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:52:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:52:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:52:11,753 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:52:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:11,776 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-22 12:52:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:52:11,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-22 12:52:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:11,784 INFO L225 Difference]: With dead ends: 217 [2024-11-22 12:52:11,784 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 12:52:11,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-22 12:52:11,790 INFO L432 NwaCegarLoop]: 159 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, 159 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-22 12:52:11,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 12:52:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-22 12:52:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 12:52:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-22 12:52:11,833 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-22 12:52:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:11,835 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-22 12:52:11,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:52:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-22 12:52:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:11,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:11,841 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:11,849 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-22 12:52:12,042 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-22 12:52:12,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 660310348, now seen corresponding path program 1 times [2024-11-22 12:52:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049841273] [2024-11-22 12:52:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-22 12:52:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049841273] [2024-11-22 12:52:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049841273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468195511] [2024-11-22 12:52:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:12,417 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-22 12:52:12,418 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-22 12:52:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:12,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:52:12,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:12,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468195511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:12,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-22 12:52:12,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524363509] [2024-11-22 12:52:12,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:12,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:12,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:12,703 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:12,743 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2024-11-22 12:52:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-22 12:52:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:12,749 INFO L225 Difference]: With dead ends: 215 [2024-11-22 12:52:12,749 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 12:52:12,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:12,751 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-22 12:52:12,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 12:52:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-22 12:52:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 12:52:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-22 12:52:12,766 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2024-11-22 12:52:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:12,768 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-22 12:52:12,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-11-22 12:52:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:52:12,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:12,771 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:12,778 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-22 12:52:12,971 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,SelfDestructingSolverStorable1 [2024-11-22 12:52:12,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1766606521, now seen corresponding path program 1 times [2024-11-22 12:52:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547820269] [2024-11-22 12:52:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547820269] [2024-11-22 12:52:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547820269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:52:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873856486] [2024-11-22 12:52:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:13,220 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:13,265 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2024-11-22 12:52:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-22 12:52:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:13,267 INFO L225 Difference]: With dead ends: 324 [2024-11-22 12:52:13,267 INFO L226 Difference]: Without dead ends: 217 [2024-11-22 12:52:13,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:13,269 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 105 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:13,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-22 12:52:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-11-22 12:52:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 180 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 314 transitions. [2024-11-22 12:52:13,286 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 314 transitions. Word has length 133 [2024-11-22 12:52:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:13,286 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 314 transitions. [2024-11-22 12:52:13,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 314 transitions. [2024-11-22 12:52:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:52:13,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:13,292 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:13,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:52:13,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1710712325, now seen corresponding path program 1 times [2024-11-22 12:52:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223070124] [2024-11-22 12:52:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223070124] [2024-11-22 12:52:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223070124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954068128] [2024-11-22 12:52:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:13,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:13,546 INFO L87 Difference]: Start difference. First operand 213 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:13,595 INFO L93 Difference]: Finished difference Result 463 states and 682 transitions. [2024-11-22 12:52:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:13,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-22 12:52:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:13,599 INFO L225 Difference]: With dead ends: 463 [2024-11-22 12:52:13,599 INFO L226 Difference]: Without dead ends: 253 [2024-11-22 12:52:13,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:13,601 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 52 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:13,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 607 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-22 12:52:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2024-11-22 12:52:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2024-11-22 12:52:13,622 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 133 [2024-11-22 12:52:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:13,623 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2024-11-22 12:52:13,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2024-11-22 12:52:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:13,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:13,625 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:13,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:52:13,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash 173559527, now seen corresponding path program 1 times [2024-11-22 12:52:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166163102] [2024-11-22 12:52:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166163102] [2024-11-22 12:52:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166163102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:52:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368887664] [2024-11-22 12:52:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:52:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:52:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:13,917 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:14,005 INFO L93 Difference]: Finished difference Result 565 states and 826 transitions. [2024-11-22 12:52:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:52:14,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:14,008 INFO L225 Difference]: With dead ends: 565 [2024-11-22 12:52:14,008 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 12:52:14,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:52:14,009 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 71 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:14,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 829 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 12:52:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2024-11-22 12:52:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 297 states have (on average 1.404040404040404) internal successors, (417), 299 states have internal predecessors, (417), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:52:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 497 transitions. [2024-11-22 12:52:14,031 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 497 transitions. Word has length 134 [2024-11-22 12:52:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:14,032 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 497 transitions. [2024-11-22 12:52:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 497 transitions. [2024-11-22 12:52:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:14,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:14,034 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:52:14,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash -219467483, now seen corresponding path program 1 times [2024-11-22 12:52:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208939893] [2024-11-22 12:52:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208939893] [2024-11-22 12:52:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208939893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143065982] [2024-11-22 12:52:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:14,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:52:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:52:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:52:14,135 INFO L87 Difference]: Start difference. First operand 342 states and 497 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:14,158 INFO L93 Difference]: Finished difference Result 685 states and 999 transitions. [2024-11-22 12:52:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:52:14,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:14,162 INFO L225 Difference]: With dead ends: 685 [2024-11-22 12:52:14,162 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 12:52:14,163 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-22 12:52:14,165 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:14,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 12:52:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-22 12:52:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 301 states have (on average 1.398671096345515) internal successors, (421), 303 states have internal predecessors, (421), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:52:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 501 transitions. [2024-11-22 12:52:14,186 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 501 transitions. Word has length 134 [2024-11-22 12:52:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 501 transitions. [2024-11-22 12:52:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 501 transitions. [2024-11-22 12:52:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:14,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:14,189 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:52:14,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash 481597095, now seen corresponding path program 1 times [2024-11-22 12:52:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870791279] [2024-11-22 12:52:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870791279] [2024-11-22 12:52:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870791279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693873197] [2024-11-22 12:52:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:14,442 INFO L87 Difference]: Start difference. First operand 346 states and 501 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:14,489 INFO L93 Difference]: Finished difference Result 752 states and 1085 transitions. [2024-11-22 12:52:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:14,493 INFO L225 Difference]: With dead ends: 752 [2024-11-22 12:52:14,493 INFO L226 Difference]: Without dead ends: 409 [2024-11-22 12:52:14,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:14,495 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:14,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 606 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-22 12:52:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 346. [2024-11-22 12:52:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 301 states have (on average 1.3853820598006645) internal successors, (417), 303 states have internal predecessors, (417), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:52:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 497 transitions. [2024-11-22 12:52:14,510 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 497 transitions. Word has length 134 [2024-11-22 12:52:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 497 transitions. [2024-11-22 12:52:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 497 transitions. [2024-11-22 12:52:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:14,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:14,513 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:14,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:52:14,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1512547611, now seen corresponding path program 1 times [2024-11-22 12:52:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872041462] [2024-11-22 12:52:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872041462] [2024-11-22 12:52:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872041462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060221075] [2024-11-22 12:52:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:15,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:15,040 INFO L87 Difference]: Start difference. First operand 346 states and 497 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:15,170 INFO L93 Difference]: Finished difference Result 756 states and 1082 transitions. [2024-11-22 12:52:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:52:15,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:15,173 INFO L225 Difference]: With dead ends: 756 [2024-11-22 12:52:15,173 INFO L226 Difference]: Without dead ends: 413 [2024-11-22 12:52:15,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:15,174 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:15,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 605 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-22 12:52:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 408. [2024-11-22 12:52:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 359 states have (on average 1.3871866295264623) internal successors, (498), 362 states have internal predecessors, (498), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 12:52:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 582 transitions. [2024-11-22 12:52:15,192 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 582 transitions. Word has length 134 [2024-11-22 12:52:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:15,193 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 582 transitions. [2024-11-22 12:52:15,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 582 transitions. [2024-11-22 12:52:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:15,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:15,195 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:15,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:52:15,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1656733667, now seen corresponding path program 1 times [2024-11-22 12:52:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:15,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836232138] [2024-11-22 12:52:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836232138] [2024-11-22 12:52:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836232138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:15,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:52:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277651331] [2024-11-22 12:52:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:15,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:15,414 INFO L87 Difference]: Start difference. First operand 408 states and 582 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:15,463 INFO L93 Difference]: Finished difference Result 816 states and 1164 transitions. [2024-11-22 12:52:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:15,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:15,465 INFO L225 Difference]: With dead ends: 816 [2024-11-22 12:52:15,465 INFO L226 Difference]: Without dead ends: 411 [2024-11-22 12:52:15,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:15,466 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:15,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 456 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-22 12:52:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2024-11-22 12:52:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.3826815642458101) internal successors, (495), 361 states have internal predecessors, (495), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 12:52:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 579 transitions. [2024-11-22 12:52:15,479 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 579 transitions. Word has length 134 [2024-11-22 12:52:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:15,479 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 579 transitions. [2024-11-22 12:52:15,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 579 transitions. [2024-11-22 12:52:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:15,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:15,481 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:15,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 12:52:15,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:15,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1937169051, now seen corresponding path program 1 times [2024-11-22 12:52:15,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:15,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446159502] [2024-11-22 12:52:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446159502] [2024-11-22 12:52:15,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446159502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:15,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:15,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283041014] [2024-11-22 12:52:15,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:15,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:15,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:15,939 INFO L87 Difference]: Start difference. First operand 407 states and 579 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:16,043 INFO L93 Difference]: Finished difference Result 821 states and 1162 transitions. [2024-11-22 12:52:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:16,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:16,045 INFO L225 Difference]: With dead ends: 821 [2024-11-22 12:52:16,045 INFO L226 Difference]: Without dead ends: 417 [2024-11-22 12:52:16,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:16,047 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 120 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:16,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 487 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-22 12:52:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2024-11-22 12:52:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 364 states have (on average 1.370879120879121) internal successors, (499), 367 states have internal predecessors, (499), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 12:52:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 583 transitions. [2024-11-22 12:52:16,060 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 583 transitions. Word has length 134 [2024-11-22 12:52:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 583 transitions. [2024-11-22 12:52:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 583 transitions. [2024-11-22 12:52:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:16,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:16,062 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:52:16,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1964771235, now seen corresponding path program 1 times [2024-11-22 12:52:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820127338] [2024-11-22 12:52:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820127338] [2024-11-22 12:52:16,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820127338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:16,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:16,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:52:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764249555] [2024-11-22 12:52:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:16,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:52:16,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:16,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:52:16,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:16,269 INFO L87 Difference]: Start difference. First operand 415 states and 583 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:16,342 INFO L93 Difference]: Finished difference Result 960 states and 1356 transitions. [2024-11-22 12:52:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:52:16,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:16,345 INFO L225 Difference]: With dead ends: 960 [2024-11-22 12:52:16,345 INFO L226 Difference]: Without dead ends: 548 [2024-11-22 12:52:16,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:52:16,347 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 148 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:16,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1346 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-22 12:52:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 462. [2024-11-22 12:52:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 400 states have (on average 1.365) internal successors, (546), 403 states have internal predecessors, (546), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 12:52:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 650 transitions. [2024-11-22 12:52:16,363 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 650 transitions. Word has length 134 [2024-11-22 12:52:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 650 transitions. [2024-11-22 12:52:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 650 transitions. [2024-11-22 12:52:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:16,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:16,365 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:52:16,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash 727317548, now seen corresponding path program 1 times [2024-11-22 12:52:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844530227] [2024-11-22 12:52:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844530227] [2024-11-22 12:52:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844530227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:16,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922635744] [2024-11-22 12:52:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:16,650 INFO L87 Difference]: Start difference. First operand 462 states and 650 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:16,909 INFO L93 Difference]: Finished difference Result 1417 states and 1997 transitions. [2024-11-22 12:52:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:52:16,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:16,914 INFO L225 Difference]: With dead ends: 1417 [2024-11-22 12:52:16,915 INFO L226 Difference]: Without dead ends: 1115 [2024-11-22 12:52:16,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:52:16,916 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 349 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:16,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1364 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-22 12:52:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1109. [2024-11-22 12:52:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.3564668769716088) internal successors, (1290), 958 states have internal predecessors, (1290), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-22 12:52:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1558 transitions. [2024-11-22 12:52:16,959 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1558 transitions. Word has length 135 [2024-11-22 12:52:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:16,960 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1558 transitions. [2024-11-22 12:52:16,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1558 transitions. [2024-11-22 12:52:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:16,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:16,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:16,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 12:52:16,962 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -90330902, now seen corresponding path program 1 times [2024-11-22 12:52:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878133734] [2024-11-22 12:52:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:16,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:17,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878133734] [2024-11-22 12:52:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878133734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:17,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:17,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366904263] [2024-11-22 12:52:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:17,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:52:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:17,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:52:17,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:52:17,072 INFO L87 Difference]: Start difference. First operand 1109 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:17,106 INFO L93 Difference]: Finished difference Result 1901 states and 2683 transitions. [2024-11-22 12:52:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:52:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:17,111 INFO L225 Difference]: With dead ends: 1901 [2024-11-22 12:52:17,111 INFO L226 Difference]: Without dead ends: 1109 [2024-11-22 12:52:17,113 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-22 12:52:17,114 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:17,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-22 12:52:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-22 12:52:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.3543638275499474) internal successors, (1288), 958 states have internal predecessors, (1288), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-22 12:52:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1556 transitions. [2024-11-22 12:52:17,183 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1556 transitions. Word has length 135 [2024-11-22 12:52:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:17,184 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1556 transitions. [2024-11-22 12:52:17,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1556 transitions. [2024-11-22 12:52:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:17,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:17,185 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:17,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 12:52:17,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:17,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1895769236, now seen corresponding path program 1 times [2024-11-22 12:52:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121765752] [2024-11-22 12:52:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121765752] [2024-11-22 12:52:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121765752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:17,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:17,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:52:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588063115] [2024-11-22 12:52:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:17,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:17,332 INFO L87 Difference]: Start difference. First operand 1109 states and 1556 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:17,389 INFO L93 Difference]: Finished difference Result 1901 states and 2679 transitions. [2024-11-22 12:52:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:17,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:17,394 INFO L225 Difference]: With dead ends: 1901 [2024-11-22 12:52:17,394 INFO L226 Difference]: Without dead ends: 1109 [2024-11-22 12:52:17,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-22 12:52:17,396 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:17,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-22 12:52:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-22 12:52:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.349106203995794) internal successors, (1283), 958 states have internal predecessors, (1283), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-22 12:52:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1551 transitions. [2024-11-22 12:52:17,439 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1551 transitions. Word has length 135 [2024-11-22 12:52:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:17,439 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1551 transitions. [2024-11-22 12:52:17,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1551 transitions. [2024-11-22 12:52:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:17,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:17,441 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:17,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 12:52:17,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:17,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1637603798, now seen corresponding path program 1 times [2024-11-22 12:52:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775985667] [2024-11-22 12:52:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:18,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:18,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775985667] [2024-11-22 12:52:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775985667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:18,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:18,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:52:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941612542] [2024-11-22 12:52:18,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:18,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:52:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:18,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:52:18,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:52:18,108 INFO L87 Difference]: Start difference. First operand 1109 states and 1551 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:18,573 INFO L93 Difference]: Finished difference Result 1355 states and 1891 transitions. [2024-11-22 12:52:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 12:52:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:18,578 INFO L225 Difference]: With dead ends: 1355 [2024-11-22 12:52:18,578 INFO L226 Difference]: Without dead ends: 1113 [2024-11-22 12:52:18,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:52:18,580 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 361 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:18,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1676 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:52:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-22 12:52:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1103. [2024-11-22 12:52:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 945 states have (on average 1.348148148148148) internal successors, (1274), 952 states have internal predecessors, (1274), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-22 12:52:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1542 transitions. [2024-11-22 12:52:18,624 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1542 transitions. Word has length 135 [2024-11-22 12:52:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1542 transitions. [2024-11-22 12:52:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1542 transitions. [2024-11-22 12:52:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:18,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:18,626 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:18,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 12:52:18,626 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:18,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -757915734, now seen corresponding path program 1 times [2024-11-22 12:52:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:18,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096142217] [2024-11-22 12:52:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096142217] [2024-11-22 12:52:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096142217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:52:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183759514] [2024-11-22 12:52:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:52:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:52:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:52:19,058 INFO L87 Difference]: Start difference. First operand 1103 states and 1542 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:19,557 INFO L93 Difference]: Finished difference Result 2118 states and 2968 transitions. [2024-11-22 12:52:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:52:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:19,562 INFO L225 Difference]: With dead ends: 2118 [2024-11-22 12:52:19,562 INFO L226 Difference]: Without dead ends: 1332 [2024-11-22 12:52:19,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:52:19,564 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 248 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:19,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2093 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:52:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-22 12:52:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1318. [2024-11-22 12:52:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1125 states have (on average 1.3484444444444443) internal successors, (1517), 1133 states have internal predecessors, (1517), 164 states have call successors, (164), 28 states have call predecessors, (164), 28 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-22 12:52:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1845 transitions. [2024-11-22 12:52:19,637 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1845 transitions. Word has length 135 [2024-11-22 12:52:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:19,637 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1845 transitions. [2024-11-22 12:52:19,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1845 transitions. [2024-11-22 12:52:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:52:19,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:19,639 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 12:52:19,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1575564184, now seen corresponding path program 1 times [2024-11-22 12:52:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150957964] [2024-11-22 12:52:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150957964] [2024-11-22 12:52:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150957964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27571396] [2024-11-22 12:52:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:19,973 INFO L87 Difference]: Start difference. First operand 1318 states and 1845 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:20,332 INFO L93 Difference]: Finished difference Result 1795 states and 2513 transitions. [2024-11-22 12:52:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:52:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-22 12:52:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:20,337 INFO L225 Difference]: With dead ends: 1795 [2024-11-22 12:52:20,337 INFO L226 Difference]: Without dead ends: 794 [2024-11-22 12:52:20,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:52:20,339 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 381 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:20,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1587 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-22 12:52:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 784. [2024-11-22 12:52:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 666 states have (on average 1.3333333333333333) internal successors, (888), 669 states have internal predecessors, (888), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1088 transitions. [2024-11-22 12:52:20,391 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1088 transitions. Word has length 135 [2024-11-22 12:52:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1088 transitions. [2024-11-22 12:52:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1088 transitions. [2024-11-22 12:52:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:52:20,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:20,393 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:20,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 12:52:20,393 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:20,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -775867618, now seen corresponding path program 1 times [2024-11-22 12:52:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348253215] [2024-11-22 12:52:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348253215] [2024-11-22 12:52:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348253215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174644026] [2024-11-22 12:52:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:20,730 INFO L87 Difference]: Start difference. First operand 784 states and 1088 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:20,967 INFO L93 Difference]: Finished difference Result 1022 states and 1417 transitions. [2024-11-22 12:52:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:52:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-22 12:52:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:20,970 INFO L225 Difference]: With dead ends: 1022 [2024-11-22 12:52:20,970 INFO L226 Difference]: Without dead ends: 786 [2024-11-22 12:52:20,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:52:20,971 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 305 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:20,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1438 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-22 12:52:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 780. [2024-11-22 12:52:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 662 states have (on average 1.3308157099697886) internal successors, (881), 665 states have internal predecessors, (881), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1081 transitions. [2024-11-22 12:52:21,002 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1081 transitions. Word has length 136 [2024-11-22 12:52:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:21,002 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1081 transitions. [2024-11-22 12:52:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1081 transitions. [2024-11-22 12:52:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:52:21,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:21,004 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 12:52:21,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1850344608, now seen corresponding path program 1 times [2024-11-22 12:52:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296474786] [2024-11-22 12:52:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296474786] [2024-11-22 12:52:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296474786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:21,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:21,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685618954] [2024-11-22 12:52:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:21,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:21,171 INFO L87 Difference]: Start difference. First operand 780 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:21,234 INFO L93 Difference]: Finished difference Result 1241 states and 1722 transitions. [2024-11-22 12:52:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-22 12:52:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:21,237 INFO L225 Difference]: With dead ends: 1241 [2024-11-22 12:52:21,237 INFO L226 Difference]: Without dead ends: 778 [2024-11-22 12:52:21,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:21,239 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 139 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:21,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 868 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-22 12:52:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2024-11-22 12:52:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 654 states have (on average 1.3256880733944953) internal successors, (867), 657 states have internal predecessors, (867), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1067 transitions. [2024-11-22 12:52:21,269 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1067 transitions. Word has length 136 [2024-11-22 12:52:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1067 transitions. [2024-11-22 12:52:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1067 transitions. [2024-11-22 12:52:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:52:21,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:21,271 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:21,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 12:52:21,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -768849576, now seen corresponding path program 1 times [2024-11-22 12:52:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285248127] [2024-11-22 12:52:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-22 12:52:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285248127] [2024-11-22 12:52:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285248127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687200941] [2024-11-22 12:52:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:21,400 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-22 12:52:21,401 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-22 12:52:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:21,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:52:21,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:21,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687200941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:21,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-22 12:52:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970861523] [2024-11-22 12:52:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:52:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:52:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:52:21,652 INFO L87 Difference]: Start difference. First operand 772 states and 1067 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:21,696 INFO L93 Difference]: Finished difference Result 1573 states and 2171 transitions. [2024-11-22 12:52:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:52:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-22 12:52:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:21,699 INFO L225 Difference]: With dead ends: 1573 [2024-11-22 12:52:21,699 INFO L226 Difference]: Without dead ends: 804 [2024-11-22 12:52:21,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:52:21,701 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:21,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 736 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-22 12:52:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-11-22 12:52:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 686 states have (on average 1.3104956268221575) internal successors, (899), 689 states have internal predecessors, (899), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1099 transitions. [2024-11-22 12:52:21,734 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1099 transitions. Word has length 139 [2024-11-22 12:52:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:21,734 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1099 transitions. [2024-11-22 12:52:21,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1099 transitions. [2024-11-22 12:52:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:52:21,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:21,736 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:21,744 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-22 12:52:21,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:21,937 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:21,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -879953882, now seen corresponding path program 1 times [2024-11-22 12:52:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833964596] [2024-11-22 12:52:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833964596] [2024-11-22 12:52:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833964596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:21,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519428932] [2024-11-22 12:52:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:21,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:52:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:52:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:52:21,985 INFO L87 Difference]: Start difference. First operand 804 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:22,012 INFO L93 Difference]: Finished difference Result 1589 states and 2171 transitions. [2024-11-22 12:52:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:52:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-22 12:52:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:22,016 INFO L225 Difference]: With dead ends: 1589 [2024-11-22 12:52:22,016 INFO L226 Difference]: Without dead ends: 788 [2024-11-22 12:52:22,017 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-22 12:52:22,018 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:22,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-22 12:52:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2024-11-22 12:52:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 670 states have (on average 1.2940298507462686) internal successors, (867), 673 states have internal predecessors, (867), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1067 transitions. [2024-11-22 12:52:22,057 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1067 transitions. Word has length 139 [2024-11-22 12:52:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:22,058 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1067 transitions. [2024-11-22 12:52:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1067 transitions. [2024-11-22 12:52:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:52:22,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:22,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:22,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 12:52:22,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:22,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1517237421, now seen corresponding path program 1 times [2024-11-22 12:52:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:22,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658653033] [2024-11-22 12:52:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658653033] [2024-11-22 12:52:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658653033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:52:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309798092] [2024-11-22 12:52:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:22,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:22,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:22,203 INFO L87 Difference]: Start difference. First operand 788 states and 1067 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:22,272 INFO L93 Difference]: Finished difference Result 1664 states and 2242 transitions. [2024-11-22 12:52:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2024-11-22 12:52:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:22,276 INFO L225 Difference]: With dead ends: 1664 [2024-11-22 12:52:22,276 INFO L226 Difference]: Without dead ends: 879 [2024-11-22 12:52:22,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:52:22,278 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 37 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:22,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 577 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-22 12:52:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 812. [2024-11-22 12:52:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 694 states have (on average 1.276657060518732) internal successors, (886), 697 states have internal predecessors, (886), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-22 12:52:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1086 transitions. [2024-11-22 12:52:22,310 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1086 transitions. Word has length 141 [2024-11-22 12:52:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:22,310 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1086 transitions. [2024-11-22 12:52:22,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1086 transitions. [2024-11-22 12:52:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:52:22,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:22,312 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 12:52:22,312 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:22,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2104043435, now seen corresponding path program 1 times [2024-11-22 12:52:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:22,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613982400] [2024-11-22 12:52:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613982400] [2024-11-22 12:52:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613982400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728322839] [2024-11-22 12:52:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:22,644 INFO L87 Difference]: Start difference. First operand 812 states and 1086 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:22,915 INFO L93 Difference]: Finished difference Result 1599 states and 2094 transitions. [2024-11-22 12:52:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:52:22,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2024-11-22 12:52:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:22,919 INFO L225 Difference]: With dead ends: 1599 [2024-11-22 12:52:22,920 INFO L226 Difference]: Without dead ends: 1081 [2024-11-22 12:52:22,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:22,922 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 209 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:22,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1085 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-22 12:52:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1066. [2024-11-22 12:52:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 904 states have (on average 1.2334070796460177) internal successors, (1115), 912 states have internal predecessors, (1115), 133 states have call successors, (133), 28 states have call predecessors, (133), 28 states have return successors, (133), 125 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-22 12:52:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1381 transitions. [2024-11-22 12:52:22,971 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1381 transitions. Word has length 141 [2024-11-22 12:52:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1381 transitions. [2024-11-22 12:52:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1381 transitions. [2024-11-22 12:52:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:52:22,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:22,973 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 12:52:22,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1829283821, now seen corresponding path program 1 times [2024-11-22 12:52:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033133039] [2024-11-22 12:52:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033133039] [2024-11-22 12:52:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033133039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:23,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345111691] [2024-11-22 12:52:23,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:23,267 INFO L87 Difference]: Start difference. First operand 1066 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:23,541 INFO L93 Difference]: Finished difference Result 2285 states and 2940 transitions. [2024-11-22 12:52:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:52:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2024-11-22 12:52:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:23,547 INFO L225 Difference]: With dead ends: 2285 [2024-11-22 12:52:23,548 INFO L226 Difference]: Without dead ends: 1222 [2024-11-22 12:52:23,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:23,551 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 162 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:23,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 865 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-22 12:52:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1212. [2024-11-22 12:52:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1025 states have (on average 1.2165853658536585) internal successors, (1247), 1036 states have internal predecessors, (1247), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-22 12:52:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1551 transitions. [2024-11-22 12:52:23,632 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1551 transitions. Word has length 141 [2024-11-22 12:52:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:23,632 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1551 transitions. [2024-11-22 12:52:23,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1551 transitions. [2024-11-22 12:52:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:52:23,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:23,634 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:23,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 12:52:23,634 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1389380650, now seen corresponding path program 1 times [2024-11-22 12:52:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:23,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193792833] [2024-11-22 12:52:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:23,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193792833] [2024-11-22 12:52:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193792833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:23,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:23,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944778096] [2024-11-22 12:52:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:23,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:52:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:52:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:52:23,795 INFO L87 Difference]: Start difference. First operand 1212 states and 1551 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:23,837 INFO L93 Difference]: Finished difference Result 2399 states and 3066 transitions. [2024-11-22 12:52:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:52:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-11-22 12:52:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:23,842 INFO L225 Difference]: With dead ends: 2399 [2024-11-22 12:52:23,842 INFO L226 Difference]: Without dead ends: 1190 [2024-11-22 12:52:23,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 12:52:23,845 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:23,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-22 12:52:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2024-11-22 12:52:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1003 states have (on average 1.1994017946161515) internal successors, (1203), 1014 states have internal predecessors, (1203), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-22 12:52:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1507 transitions. [2024-11-22 12:52:23,901 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1507 transitions. Word has length 142 [2024-11-22 12:52:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:23,902 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1507 transitions. [2024-11-22 12:52:23,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1507 transitions. [2024-11-22 12:52:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:52:23,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:23,903 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:23,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 12:52:23,904 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -955255966, now seen corresponding path program 1 times [2024-11-22 12:52:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813660395] [2024-11-22 12:52:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:24,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813660395] [2024-11-22 12:52:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813660395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:52:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80613961] [2024-11-22 12:52:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:24,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:52:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:52:24,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:52:24,179 INFO L87 Difference]: Start difference. First operand 1190 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:24,305 INFO L93 Difference]: Finished difference Result 1233 states and 1559 transitions. [2024-11-22 12:52:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:52:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-11-22 12:52:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:24,310 INFO L225 Difference]: With dead ends: 1233 [2024-11-22 12:52:24,310 INFO L226 Difference]: Without dead ends: 1231 [2024-11-22 12:52:24,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:24,311 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 120 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:24,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1234 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-22 12:52:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1229. [2024-11-22 12:52:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1042 states have (on average 1.1871401151631478) internal successors, (1237), 1053 states have internal predecessors, (1237), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-22 12:52:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1541 transitions. [2024-11-22 12:52:24,366 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1541 transitions. Word has length 142 [2024-11-22 12:52:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:24,367 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1541 transitions. [2024-11-22 12:52:24,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1541 transitions. [2024-11-22 12:52:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:52:24,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:24,368 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:24,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 12:52:24,368 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1027642524, now seen corresponding path program 1 times [2024-11-22 12:52:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662884527] [2024-11-22 12:52:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 12:52:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423168948] [2024-11-22 12:52:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:24,427 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-22 12:52:24,428 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-22 12:52:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:24,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 12:52:24,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:24,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:52:25,600 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 39 treesize of output 27 [2024-11-22 12:52:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:52:25,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:52:25,948 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 52 treesize of output 48 [2024-11-22 12:52:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:52:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662884527] [2024-11-22 12:52:26,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 12:52:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423168948] [2024-11-22 12:52:26,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423168948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:26,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:26,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-22 12:52:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011388336] [2024-11-22 12:52:26,805 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 12:52:26,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:52:26,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:52:26,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:52:26,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:52:26,807 INFO L87 Difference]: Start difference. First operand 1229 states and 1541 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-22 12:52:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:27,211 INFO L93 Difference]: Finished difference Result 2385 states and 2987 transitions. [2024-11-22 12:52:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:52:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2024-11-22 12:52:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:27,216 INFO L225 Difference]: With dead ends: 2385 [2024-11-22 12:52:27,216 INFO L226 Difference]: Without dead ends: 1159 [2024-11-22 12:52:27,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:52:27,218 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 187 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:27,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1100 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:52:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-22 12:52:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1141. [2024-11-22 12:52:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 964 states have (on average 1.1898340248962656) internal successors, (1147), 973 states have internal predecessors, (1147), 142 states have call successors, (142), 34 states have call predecessors, (142), 34 states have return successors, (142), 133 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-22 12:52:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1431 transitions. [2024-11-22 12:52:27,273 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1431 transitions. Word has length 142 [2024-11-22 12:52:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:27,273 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1431 transitions. [2024-11-22 12:52:27,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-22 12:52:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1431 transitions. [2024-11-22 12:52:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:52:27,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:27,274 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:27,283 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-22 12:52:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 12:52:27,475 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 763706976, now seen corresponding path program 1 times [2024-11-22 12:52:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:52:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637169452] [2024-11-22 12:52:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:52:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 12:52:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114902168] [2024-11-22 12:52:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:27,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:52:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:27,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:52:27,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 12:52:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:52:27,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:52:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:52:28,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:52:28,014 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:52:28,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:52:28,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 12:52:28,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 12:52:28,219 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 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-22 12:52:28,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:52:28,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:52:28 BoogieIcfgContainer [2024-11-22 12:52:28,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:52:28,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:52:28,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:52:28,339 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:52:28,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:11" (3/4) ... [2024-11-22 12:52:28,341 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:52:28,342 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:52:28,343 INFO L158 Benchmark]: Toolchain (without parser) took 18449.09ms. Allocated memory was 195.0MB in the beginning and 748.7MB in the end (delta: 553.6MB). Free memory was 146.5MB in the beginning and 424.8MB in the end (delta: -278.3MB). Peak memory consumption was 274.5MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,343 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:52:28,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.97ms. Allocated memory is still 195.0MB. Free memory was 146.1MB in the beginning and 130.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.83ms. Allocated memory is still 195.0MB. Free memory was 130.4MB in the beginning and 126.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,344 INFO L158 Benchmark]: Boogie Preprocessor took 82.00ms. Allocated memory is still 195.0MB. Free memory was 126.6MB in the beginning and 121.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,344 INFO L158 Benchmark]: RCFGBuilder took 699.63ms. Allocated memory is still 195.0MB. Free memory was 121.1MB in the beginning and 127.2MB in the end (delta: -6.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,347 INFO L158 Benchmark]: TraceAbstraction took 17320.87ms. Allocated memory was 195.0MB in the beginning and 748.7MB in the end (delta: 553.6MB). Free memory was 126.7MB in the beginning and 425.9MB in the end (delta: -299.1MB). Peak memory consumption was 256.6MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,347 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 748.7MB. Free memory was 425.9MB in the beginning and 424.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 12:52:28,348 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.15ms. Allocated memory is still 104.9MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.97ms. Allocated memory is still 195.0MB. Free memory was 146.1MB in the beginning and 130.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.83ms. Allocated memory is still 195.0MB. Free memory was 130.4MB in the beginning and 126.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.00ms. Allocated memory is still 195.0MB. Free memory was 126.6MB in the beginning and 121.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 699.63ms. Allocated memory is still 195.0MB. Free memory was 121.1MB in the beginning and 127.2MB in the end (delta: -6.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17320.87ms. Allocated memory was 195.0MB in the beginning and 748.7MB in the end (delta: 553.6MB). Free memory was 126.7MB in the beginning and 425.9MB in the end (delta: -299.1MB). Peak memory consumption was 256.6MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 748.7MB. Free memory was 425.9MB in the beginning and 424.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L22] unsigned short int var_1_1 = 25; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_5 = 16; [L26] signed char var_1_5 = 16; [L27] signed char* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 16; [L28] unsigned short int var_1_6 = 16; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_7 = 4; [L30] signed char var_1_7 = 4; [L31] signed char* var_1_7_Pointer = &(var_1_7); [L32] unsigned short int var_1_8 = 2; [L32] unsigned short int var_1_8 = 2; [L33] unsigned short int* var_1_8_Pointer = &(var_1_8); [L34] signed char var_1_9 = 64; [L34] signed char var_1_9 = 64; [L35] signed char* var_1_9_Pointer = &(var_1_9); [L36] signed char var_1_10 = 0; [L36] signed char var_1_10 = 0; [L37] signed char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 16; [L38] unsigned char var_1_11 = 16; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 128.4; [L40] double var_1_12 = 128.4; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 50.2; [L42] double var_1_13 = 50.2; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = 3.8; [L44] double var_1_14 = 3.8; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 25.1; [L46] double var_1_15 = 25.1; [L47] double* var_1_15_Pointer = &(var_1_15); VAL [isInitial=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L76] var_1_6 = __VERIFIER_nondet_ushort() [L77] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_7 = __VERIFIER_nondet_char() [L81] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_9 = __VERIFIER_nondet_char() [L84] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_12 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_14) [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L94] EXPR \read(var_1_14) [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_15) [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L96] EXPR \read(var_1_15) [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] RET updateVariables() [L110] CALL step() [L51] EXPR \read(*var_1_12_Pointer) [L51] EXPR \read(*var_1_13_Pointer) [L51] EXPR \read(*var_1_14_Pointer) [L51] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L51] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) [L51] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L51] COND FALSE !((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) [L54] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] COND FALSE !((*(var_1_2_Pointer))) [L57] EXPR \read(*var_1_1_Pointer) [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) [L57] EXPR \read(*var_1_11_Pointer) [L57] EXPR \read(*var_1_6_Pointer) [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] COND FALSE !(((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) [L60] (*(var_1_5_Pointer)) = 5 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR \read(*var_1_11_Pointer) [L62] unsigned char stepLocal_1 = (*(var_1_11_Pointer)); [L63] EXPR \read(*var_1_2_Pointer) [L63] unsigned char stepLocal_0 = (*(var_1_2_Pointer)); [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, stepLocal_1=16, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_11_Pointer) [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, stepLocal_1=16, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L64] COND TRUE stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L65] EXPR \read(*var_1_9_Pointer) [L65] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L65] COND FALSE !(stepLocal_1 < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1 [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)) [L101] EXPR \read(*var_1_5_Pointer) [L101] EXPR (((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_9_Pointer) [L101] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1 [L101] EXPR ((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L101] EXPR \read(*var_1_12_Pointer) [L101] EXPR \read(*var_1_13_Pointer) [L101] EXPR \read(*var_1_14_Pointer) [L101] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) [L101] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR ((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101-L102] return ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 28, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3196 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 22276 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16794 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3199 IncrementalHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 5482 mSDtfsCounter, 3199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1318occurred in iteration=16, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 363 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 4502 NumberOfCodeBlocks, 4502 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4046 ConstructedInterpolants, 0 QuantifiedInterpolants, 11146 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2290 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12282/12600 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-22 12:52:28,373 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.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 cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:52:30,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:52:30,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:52:30,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:52:30,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:52:30,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:52:30,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:52:30,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:52:30,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:52:30,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:52:30,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:52:30,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:52:30,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:52:30,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:52:30,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:52:30,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:52:30,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:52:30,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:52:30,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:52:30,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:52:30,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:52:30,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:52:30,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:52:30,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:52:30,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:52:30,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:52:30,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:52:30,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:52:30,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:52:30,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:52:30,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:52:30,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:52:30,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:52:30,229 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:52:30,229 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:52:30,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:52:30,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:52:30,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:52:30,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:52:30,231 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 -> cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 [2024-11-22 12:52:30,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:52:30,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:52:30,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:52:30,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:52:30,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:52:30,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:31,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:52:31,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:52:31,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:31,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799d4a9b1/e945da85c9ed44979154e02233e97634/FLAGdef642a5e [2024-11-22 12:52:31,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799d4a9b1/e945da85c9ed44979154e02233e97634 [2024-11-22 12:52:31,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:52:31,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:52:31,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:52:31,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:52:31,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:52:31,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:31" (1/1) ... [2024-11-22 12:52:31,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49978122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:31, skipping insertion in model container [2024-11-22 12:52:31,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:31" (1/1) ... [2024-11-22 12:52:31,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:52:32,123 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-p_file-13.i[916,929] [2024-11-22 12:52:32,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:52:32,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:52:32,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i[916,929] [2024-11-22 12:52:32,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:52:32,264 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:52:32,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32 WrapperNode [2024-11-22 12:52:32,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:52:32,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:52:32,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:52:32,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:52:32,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,319 INFO L138 Inliner]: procedures = 33, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-22 12:52:32,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:52:32,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:52:32,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:52:32,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:52:32,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,373 INFO L175 MemorySlicer]: Split 115 memory accesses to 14 slices as follows [2, 5, 8, 5, 7, 6, 5, 10, 10, 23, 8, 8, 8, 10]. 20 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-22 12:52:32,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:52:32,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:52:32,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:52:32,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:52:32,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (1/1) ... [2024-11-22 12:52:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:52:32,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:52:32,455 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-22 12:52:32,458 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-22 12:52:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:52:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:52:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:52:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:52:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:52:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:52:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-22 12:52:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-22 12:52:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-22 12:52:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:52:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:52:32,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:52:32,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-22 12:52:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:52:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-22 12:52:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-22 12:52:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-22 12:52:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-22 12:52:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-22 12:52:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-22 12:52:32,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-22 12:52:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-22 12:52:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-22 12:52:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-22 12:52:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:52:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:52:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:52:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:52:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:52:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-22 12:52:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-22 12:52:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-22 12:52:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-22 12:52:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:52:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-22 12:52:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-22 12:52:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:52:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:52:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:52:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:52:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-22 12:52:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-22 12:52:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:52:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:52:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:52:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:52:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-22 12:52:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-22 12:52:32,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:52:32,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:52:40,660 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-22 12:52:40,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:52:40,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:52:40,678 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:52:40,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:40 BoogieIcfgContainer [2024-11-22 12:52:40,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:52:40,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:52:40,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:52:40,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:52:40,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:52:31" (1/3) ... [2024-11-22 12:52:40,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f8dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:40, skipping insertion in model container [2024-11-22 12:52:40,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:32" (2/3) ... [2024-11-22 12:52:40,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f8dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:40, skipping insertion in model container [2024-11-22 12:52:40,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:40" (3/3) ... [2024-11-22 12:52:40,684 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-13.i [2024-11-22 12:52:40,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:52:40,696 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:52:40,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:52:40,767 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;@c841e6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:52:40,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:52:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 12:52:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:40,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:40,781 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:40,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:40,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1910210082, now seen corresponding path program 1 times [2024-11-22 12:52:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:40,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154162450] [2024-11-22 12:52:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:40,799 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-22 12:52:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:40,801 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-22 12:52:40,805 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-22 12:52:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:41,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:52:41,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-22 12:52:41,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:41,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154162450] [2024-11-22 12:52:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154162450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:52:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928389173] [2024-11-22 12:52:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:41,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:52:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:41,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:52:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:52:41,378 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:52:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:41,403 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-22 12:52:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:52:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-22 12:52:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:41,410 INFO L225 Difference]: With dead ends: 217 [2024-11-22 12:52:41,410 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 12:52:41,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-22 12:52:41,415 INFO L432 NwaCegarLoop]: 159 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, 159 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-22 12:52:41,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 12:52:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-22 12:52:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 12:52:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-22 12:52:41,448 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-22 12:52:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-22 12:52:41,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:52:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-22 12:52:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:41,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:41,451 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:41,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 12:52:41,652 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-22 12:52:41,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 660310348, now seen corresponding path program 1 times [2024-11-22 12:52:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608843592] [2024-11-22 12:52:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:41,654 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-22 12:52:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:41,656 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-22 12:52:41,657 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-22 12:52:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:42,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:52:42,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:42,651 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 34 treesize of output 22 [2024-11-22 12:52:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:42,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:42,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608843592] [2024-11-22 12:52:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608843592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:42,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025361249] [2024-11-22 12:52:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:42,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:42,687 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:42,820 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2024-11-22 12:52:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-22 12:52:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:42,823 INFO L225 Difference]: With dead ends: 318 [2024-11-22 12:52:42,824 INFO L226 Difference]: Without dead ends: 213 [2024-11-22 12:52:42,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:42,826 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 87 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:42,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-22 12:52:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-11-22 12:52:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.4204545454545454) internal successors, (250), 176 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2024-11-22 12:52:42,849 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 131 [2024-11-22 12:52:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:42,849 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2024-11-22 12:52:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2024-11-22 12:52:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:42,851 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:42,870 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-22 12:52:43,052 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-22 12:52:43,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:43,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1333834358, now seen corresponding path program 1 times [2024-11-22 12:52:43,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175429394] [2024-11-22 12:52:43,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:43,054 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-22 12:52:43,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:43,055 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-22 12:52:43,056 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-22 12:52:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:43,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:52:43,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 12:52:44,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:52:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:44,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175429394] [2024-11-22 12:52:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175429394] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-22 12:52:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186602042] [2024-11-22 12:52:44,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:44,274 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:44,395 INFO L93 Difference]: Finished difference Result 461 states and 684 transitions. [2024-11-22 12:52:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-22 12:52:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:44,398 INFO L225 Difference]: With dead ends: 461 [2024-11-22 12:52:44,400 INFO L226 Difference]: Without dead ends: 255 [2024-11-22 12:52:44,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:52:44,404 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 60 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:44,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 605 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-22 12:52:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 214. [2024-11-22 12:52:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 181 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2024-11-22 12:52:44,428 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 131 [2024-11-22 12:52:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:44,428 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2024-11-22 12:52:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2024-11-22 12:52:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 12:52:44,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:44,430 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:44,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:52:44,633 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-22 12:52:44,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1681269260, now seen corresponding path program 1 times [2024-11-22 12:52:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125760835] [2024-11-22 12:52:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:44,635 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-22 12:52:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:44,638 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-22 12:52:44,641 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-22 12:52:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:45,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:52:45,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:45,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:45,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125760835] [2024-11-22 12:52:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125760835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:52:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076858305] [2024-11-22 12:52:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:45,108 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:45,141 INFO L93 Difference]: Finished difference Result 429 states and 635 transitions. [2024-11-22 12:52:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-22 12:52:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:45,144 INFO L225 Difference]: With dead ends: 429 [2024-11-22 12:52:45,144 INFO L226 Difference]: Without dead ends: 218 [2024-11-22 12:52:45,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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-22 12:52:45,145 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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-22 12:52:45,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-22 12:52:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-22 12:52:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.4054054054054055) internal successors, (260), 185 states have internal predecessors, (260), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2024-11-22 12:52:45,154 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 131 [2024-11-22 12:52:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2024-11-22 12:52:45,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2024-11-22 12:52:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:52:45,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:45,168 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:45,186 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 (5)] Ended with exit code 0 [2024-11-22 12:52:45,368 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-22 12:52:45,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 122364423, now seen corresponding path program 1 times [2024-11-22 12:52:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705582805] [2024-11-22 12:52:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:45,370 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-22 12:52:45,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:45,373 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-22 12:52:45,375 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-22 12:52:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:45,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:52:45,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 12:52:46,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:52:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:46,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705582805] [2024-11-22 12:52:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705582805] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:46,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-22 12:52:46,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925866079] [2024-11-22 12:52:46,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:46,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:46,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:46,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:46,434 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:46,525 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2024-11-22 12:52:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:52:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-22 12:52:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:46,528 INFO L225 Difference]: With dead ends: 468 [2024-11-22 12:52:46,528 INFO L226 Difference]: Without dead ends: 253 [2024-11-22 12:52:46,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:52:46,529 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 456 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:46,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 456 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:52:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-22 12:52:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2024-11-22 12:52:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.402116402116402) internal successors, (265), 189 states have internal predecessors, (265), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2024-11-22 12:52:46,540 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 133 [2024-11-22 12:52:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:46,540 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2024-11-22 12:52:46,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2024-11-22 12:52:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:46,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:46,543 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:46,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 12:52:46,746 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-22 12:52:46,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1820585179, now seen corresponding path program 1 times [2024-11-22 12:52:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832634466] [2024-11-22 12:52:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:46,748 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-22 12:52:46,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:46,750 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-22 12:52:46,751 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-22 12:52:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:47,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:52:47,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:47,500 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 34 treesize of output 22 [2024-11-22 12:52:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:47,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:52:47,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832634466] [2024-11-22 12:52:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832634466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:52:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:52:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:52:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213184485] [2024-11-22 12:52:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:52:47,516 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:47,576 INFO L93 Difference]: Finished difference Result 445 states and 651 transitions. [2024-11-22 12:52:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:47,579 INFO L225 Difference]: With dead ends: 445 [2024-11-22 12:52:47,579 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 12:52:47,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:52:47,581 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 70 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:47,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 456 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:52:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 12:52:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-11-22 12:52:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 189 states have internal predecessors, (264), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 12:52:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 324 transitions. [2024-11-22 12:52:47,592 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 324 transitions. Word has length 134 [2024-11-22 12:52:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 324 transitions. [2024-11-22 12:52:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 324 transitions. [2024-11-22 12:52:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:47,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:47,595 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:47,610 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-22 12:52:47,795 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-22 12:52:47,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1119520601, now seen corresponding path program 1 times [2024-11-22 12:52:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119252660] [2024-11-22 12:52:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:47,797 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-22 12:52:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:47,798 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-22 12:52:47,799 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-22 12:52:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:48,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:52:48,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:48,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 12:52:48,726 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 50 treesize of output 38 [2024-11-22 12:52:48,732 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 46 treesize of output 34 [2024-11-22 12:52:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:52:48,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:52:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:49,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119252660] [2024-11-22 12:52:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119252660] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:49,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:49,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-22 12:52:49,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828130923] [2024-11-22 12:52:49,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:49,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:52:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:52:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:52:49,316 INFO L87 Difference]: Start difference. First operand 222 states and 324 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:52,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:52:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:52:52,666 INFO L93 Difference]: Finished difference Result 564 states and 818 transitions. [2024-11-22 12:52:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:52:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:52:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:52:52,691 INFO L225 Difference]: With dead ends: 564 [2024-11-22 12:52:52,691 INFO L226 Difference]: Without dead ends: 345 [2024-11-22 12:52:52,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:52:52,692 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:52:52,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 411 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-22 12:52:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-22 12:52:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2024-11-22 12:52:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 302 states have (on average 1.400662251655629) internal successors, (423), 304 states have internal predecessors, (423), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 12:52:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 491 transitions. [2024-11-22 12:52:52,707 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 491 transitions. Word has length 134 [2024-11-22 12:52:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:52:52,708 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 491 transitions. [2024-11-22 12:52:52,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 491 transitions. [2024-11-22 12:52:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:52:52,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:52:52,710 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:52:52,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 12:52:52,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:52:52,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:52:52,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:52:52,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1937169051, now seen corresponding path program 1 times [2024-11-22 12:52:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:52:52,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869715996] [2024-11-22 12:52:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:52:52,912 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-22 12:52:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:52:52,913 INFO L229 MonitoredProcess]: Starting monitored process 9 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-22 12:52:52,914 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 (9)] Waiting until timeout for monitored process [2024-11-22 12:52:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:52:53,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:52:53,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:52:53,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 12:52:54,157 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 50 treesize of output 38 [2024-11-22 12:52:54,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-22 12:52:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:52:54,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:52:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:52:55,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:52:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869715996] [2024-11-22 12:52:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869715996] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:52:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:52:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-22 12:52:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089508780] [2024-11-22 12:52:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:52:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:52:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:52:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:52:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:52:55,070 INFO L87 Difference]: Start difference. First operand 341 states and 491 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:52:58,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:00,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:53:00,204 INFO L93 Difference]: Finished difference Result 787 states and 1129 transitions. [2024-11-22 12:53:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:53:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:53:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:53:00,231 INFO L225 Difference]: With dead ends: 787 [2024-11-22 12:53:00,231 INFO L226 Difference]: Without dead ends: 449 [2024-11-22 12:53:00,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:53:00,232 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 73 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:53:00,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 537 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-22 12:53:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-22 12:53:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 342. [2024-11-22 12:53:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 303 states have (on average 1.396039603960396) internal successors, (423), 305 states have internal predecessors, (423), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 12:53:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2024-11-22 12:53:00,249 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 134 [2024-11-22 12:53:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:53:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2024-11-22 12:53:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:53:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2024-11-22 12:53:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:53:00,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:53:00,251 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:53:00,268 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 12:53:00,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-22 12:53:00,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:53:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:53:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1964771235, now seen corresponding path program 1 times [2024-11-22 12:53:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:53:00,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458383095] [2024-11-22 12:53:00,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:00,453 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-22 12:53:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:53:00,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:53:00,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 12:53:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:00,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:53:00,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:00,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 12:53:00,957 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 37 treesize of output 25 [2024-11-22 12:53:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 12:53:00,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:53:00,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:53:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458383095] [2024-11-22 12:53:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458383095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:53:00,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:53:00,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:53:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700264141] [2024-11-22 12:53:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:53:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:53:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:53:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:53:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:53:00,994 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:53:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:53:01,117 INFO L93 Difference]: Finished difference Result 894 states and 1285 transitions. [2024-11-22 12:53:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:53:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-22 12:53:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:53:01,121 INFO L225 Difference]: With dead ends: 894 [2024-11-22 12:53:01,121 INFO L226 Difference]: Without dead ends: 555 [2024-11-22 12:53:01,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:53:01,122 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:53:01,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1221 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:53:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-22 12:53:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 513. [2024-11-22 12:53:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.3795454545454546) internal successors, (607), 444 states have internal predecessors, (607), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 12:53:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 735 transitions. [2024-11-22 12:53:01,145 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 735 transitions. Word has length 134 [2024-11-22 12:53:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:53:01,147 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 735 transitions. [2024-11-22 12:53:01,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-22 12:53:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 735 transitions. [2024-11-22 12:53:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:53:01,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:53:01,148 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:53:01,166 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 12:53:01,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-22 12:53:01,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:53:01,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:53:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash -978971991, now seen corresponding path program 1 times [2024-11-22 12:53:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:53:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766118400] [2024-11-22 12:53:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:01,350 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-22 12:53:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:53:01,351 INFO L229 MonitoredProcess]: Starting monitored process 11 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-22 12:53:01,352 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 (11)] Waiting until timeout for monitored process [2024-11-22 12:53:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:01,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:53:01,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:02,751 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 50 treesize of output 38 [2024-11-22 12:53:02,756 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 46 treesize of output 34 [2024-11-22 12:53:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:53:02,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:53:05,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:53:05,241 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 28 treesize of output 31 [2024-11-22 12:53:05,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:53:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766118400] [2024-11-22 12:53:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766118400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:53:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [798165460] [2024-11-22 12:53:05,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:05,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:53:05,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:53:05,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:53:05,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-22 12:53:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:06,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:53:06,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:07,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:53:07,369 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 155 treesize of output 65 [2024-11-22 12:53:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-22 12:53:07,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:53:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [798165460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:53:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:53:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-22 12:53:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282723656] [2024-11-22 12:53:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:53:07,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:53:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:53:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:53:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:53:07,605 INFO L87 Difference]: Start difference. First operand 513 states and 735 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:53:09,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:12,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:14,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:53:15,491 INFO L93 Difference]: Finished difference Result 1018 states and 1461 transitions. [2024-11-22 12:53:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:53:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-22 12:53:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:53:15,512 INFO L225 Difference]: With dead ends: 1018 [2024-11-22 12:53:15,513 INFO L226 Difference]: Without dead ends: 517 [2024-11-22 12:53:15,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:53:15,514 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 117 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:53:15,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 489 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-22 12:53:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-22 12:53:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2024-11-22 12:53:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.3704545454545454) internal successors, (603), 444 states have internal predecessors, (603), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 12:53:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 731 transitions. [2024-11-22 12:53:15,529 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 731 transitions. Word has length 134 [2024-11-22 12:53:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:53:15,529 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 731 transitions. [2024-11-22 12:53:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:53:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 731 transitions. [2024-11-22 12:53:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:53:15,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:53:15,530 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:53:15,548 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 (11)] Ended with exit code 0 [2024-11-22 12:53:15,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-22 12:53:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:53:15,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:53:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:53:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1401976657, now seen corresponding path program 1 times [2024-11-22 12:53:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:53:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104704124] [2024-11-22 12:53:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:15,932 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-22 12:53:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:53:15,933 INFO L229 MonitoredProcess]: Starting monitored process 13 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-22 12:53:15,934 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 (13)] Waiting until timeout for monitored process [2024-11-22 12:53:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:16,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:53:16,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:17,257 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 50 treesize of output 38 [2024-11-22 12:53:17,261 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 46 treesize of output 34 [2024-11-22 12:53:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:53:17,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:53:20,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:53:20,162 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 28 treesize of output 31 [2024-11-22 12:53:20,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:53:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104704124] [2024-11-22 12:53:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104704124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:53:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033655194] [2024-11-22 12:53:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:53:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:53:20,801 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:53:20,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-22 12:53:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:21,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 12:53:21,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:22,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:53:22,716 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 153 treesize of output 63 [2024-11-22 12:53:23,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:53:23,044 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 155 treesize of output 65 [2024-11-22 12:53:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:53:23,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:53:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2033655194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:53:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:53:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-11-22 12:53:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534634175] [2024-11-22 12:53:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:53:23,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:53:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:53:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:53:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:53:23,268 INFO L87 Difference]: Start difference. First operand 513 states and 731 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:53:25,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:27,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:29,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:31,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:53:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:53:31,176 INFO L93 Difference]: Finished difference Result 1026 states and 1461 transitions. [2024-11-22 12:53:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:53:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-22 12:53:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:53:31,198 INFO L225 Difference]: With dead ends: 1026 [2024-11-22 12:53:31,199 INFO L226 Difference]: Without dead ends: 525 [2024-11-22 12:53:31,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-11-22 12:53:31,200 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 112 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:53:31,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 761 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-22 12:53:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-22 12:53:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 513. [2024-11-22 12:53:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.3613636363636363) internal successors, (599), 444 states have internal predecessors, (599), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 12:53:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 727 transitions. [2024-11-22 12:53:31,218 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 727 transitions. Word has length 136 [2024-11-22 12:53:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:53:31,218 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 727 transitions. [2024-11-22 12:53:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-22 12:53:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 727 transitions. [2024-11-22 12:53:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 12:53:31,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:53:31,219 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:53:31,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-22 12:53:31,436 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 (13)] Ended with exit code 0 [2024-11-22 12:53:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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-22 12:53:31,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:53:31,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:53:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1748494825, now seen corresponding path program 1 times [2024-11-22 12:53:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:53:31,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949996993] [2024-11-22 12:53:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:53:31,621 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-22 12:53:31,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:53:31,623 INFO L229 MonitoredProcess]: Starting monitored process 15 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-22 12:53:31,624 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 (15)] Waiting until timeout for monitored process [2024-11-22 12:53:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:53:32,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:53:32,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:53:33,167 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 50 treesize of output 38 [2024-11-22 12:53:33,175 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 46 treesize of output 34 [2024-11-22 12:53:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 12:53:33,238 INFO L311 TraceCheckSpWp]: Computing backward predicates...