./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:45:07,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:45:07,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:45:07,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:45:07,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:45:07,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:45:07,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:45:07,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:45:07,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:45:07,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:45:07,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:45:07,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:45:07,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:45:07,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:45:07,974 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:45:07,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:45:07,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:45:07,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:45:07,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:45:07,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:45:07,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:45:07,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:45:07,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:45:07,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:45:07,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:45:07,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:45:07,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:45:07,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:45:07,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:45:07,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:45:07,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:45:07,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:45:07,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:45:07,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:45:07,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:45:07,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:45:07,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:45:07,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:45:07,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:45:07,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:45:07,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:45:07,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:45:07,986 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2024-10-14 13:45:08,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:45:08,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:45:08,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:45:08,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:45:08,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:45:08,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:09,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:45:09,872 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:45:09,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:09,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb080a71/76bf49bb2ec2433fb9d6af40c08c97ba/FLAG3b121361d [2024-10-14 13:45:09,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb080a71/76bf49bb2ec2433fb9d6af40c08c97ba [2024-10-14 13:45:09,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:45:09,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:45:09,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:45:09,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:45:09,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:45:09,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:09" (1/1) ... [2024-10-14 13:45:09,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a53216a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:09, skipping insertion in model container [2024-10-14 13:45:09,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:09" (1/1) ... [2024-10-14 13:45:09,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:45:10,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2024-10-14 13:45:10,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:45:10,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:45:10,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2024-10-14 13:45:10,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:45:10,286 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:45:10,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10 WrapperNode [2024-10-14 13:45:10,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:45:10,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:45:10,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:45:10,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:45:10,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,362 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-10-14 13:45:10,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:45:10,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:45:10,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:45:10,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:45:10,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,415 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-10-14 13:45:10,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:45:10,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:45:10,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:45:10,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:45:10,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (1/1) ... [2024-10-14 13:45:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:45:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:10,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:45:10,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:45:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:45:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:45:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:45:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:45:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-14 13:45:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:45:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 13:45:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:45:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:45:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:45:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:45:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:45:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:45:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 13:45:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-14 13:45:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-14 13:45:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:45:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:45:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:45:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:45:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:45:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:45:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:45:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-14 13:45:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-14 13:45:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-14 13:45:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:45:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:45:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:45:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 13:45:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 13:45:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 13:45:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 13:45:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 13:45:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 13:45:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 13:45:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 13:45:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:45:10,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:45:10,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:45:10,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:45:11,428 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-14 13:45:11,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:45:11,482 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:45:11,483 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:45:11,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:11 BoogieIcfgContainer [2024-10-14 13:45:11,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:45:11,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:45:11,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:45:11,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:45:11,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:45:09" (1/3) ... [2024-10-14 13:45:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49fe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:11, skipping insertion in model container [2024-10-14 13:45:11,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:10" (2/3) ... [2024-10-14 13:45:11,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49fe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:11, skipping insertion in model container [2024-10-14 13:45:11,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:11" (3/3) ... [2024-10-14 13:45:11,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:11,509 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:45:11,509 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:45:11,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:45:11,574 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;@59ce37bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:45:11,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:45:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 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-10-14 13:45:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 13:45:11,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:11,593 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] [2024-10-14 13:45:11,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -118543216, now seen corresponding path program 1 times [2024-10-14 13:45:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437411366] [2024-10-14 13:45:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437411366] [2024-10-14 13:45:12,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437411366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:12,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:45:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833816950] [2024-10-14 13:45:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:12,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:45:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:45:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:45:12,106 INFO L87 Difference]: Start difference. First operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:12,156 INFO L93 Difference]: Finished difference Result 193 states and 307 transitions. [2024-10-14 13:45:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:45:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 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 119 [2024-10-14 13:45:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:12,168 INFO L225 Difference]: With dead ends: 193 [2024-10-14 13:45:12,168 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 13:45:12,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:45:12,175 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 13:45:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 13:45:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 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-10-14 13:45:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-10-14 13:45:12,222 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 119 [2024-10-14 13:45:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-10-14 13:45:12,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-10-14 13:45:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 13:45:12,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:12,233 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] [2024-10-14 13:45:12,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:45:12,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:12,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 890970722, now seen corresponding path program 1 times [2024-10-14 13:45:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701204422] [2024-10-14 13:45:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:12,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701204422] [2024-10-14 13:45:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701204422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:12,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:45:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784301225] [2024-10-14 13:45:12,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:45:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:45:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:45:12,634 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 13:45:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:12,699 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2024-10-14 13:45:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:45:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 119 [2024-10-14 13:45:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:12,704 INFO L225 Difference]: With dead ends: 194 [2024-10-14 13:45:12,704 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 13:45:12,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:45:12,707 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:12,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 13:45:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-14 13:45:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 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-10-14 13:45:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-14 13:45:12,722 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 119 [2024-10-14 13:45:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:12,724 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-14 13:45:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 13:45:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-14 13:45:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 13:45:12,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:12,726 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] [2024-10-14 13:45:12,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:45:12,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 81624096, now seen corresponding path program 1 times [2024-10-14 13:45:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260102593] [2024-10-14 13:45:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:12,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260102593] [2024-10-14 13:45:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260102593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:13,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:45:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848510604] [2024-10-14 13:45:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:45:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:45:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:45:13,065 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 13:45:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:13,116 INFO L93 Difference]: Finished difference Result 198 states and 291 transitions. [2024-10-14 13:45:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:45:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 119 [2024-10-14 13:45:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:13,119 INFO L225 Difference]: With dead ends: 198 [2024-10-14 13:45:13,122 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 13:45:13,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:45:13,126 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:13,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 13:45:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-14 13:45:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 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-10-14 13:45:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-10-14 13:45:13,144 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 119 [2024-10-14 13:45:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:13,145 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-10-14 13:45:13,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 13:45:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-10-14 13:45:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 13:45:13,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:13,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] [2024-10-14 13:45:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:45:13,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 81683678, now seen corresponding path program 1 times [2024-10-14 13:45:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137500829] [2024-10-14 13:45:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137500829] [2024-10-14 13:45:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137500829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:14,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:45:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38970448] [2024-10-14 13:45:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:14,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:45:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:45:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:45:14,159 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:45:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:14,453 INFO L93 Difference]: Finished difference Result 212 states and 307 transitions. [2024-10-14 13:45:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:45:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2024-10-14 13:45:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:14,457 INFO L225 Difference]: With dead ends: 212 [2024-10-14 13:45:14,457 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 13:45:14,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:45:14,461 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 202 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:14,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 554 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:45:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 13:45:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-14 13:45:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 91 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:45:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-10-14 13:45:14,482 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 119 [2024-10-14 13:45:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:14,483 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-10-14 13:45:14,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 13:45:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-10-14 13:45:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:45:14,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:14,485 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] [2024-10-14 13:45:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:45:14,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1517701381, now seen corresponding path program 1 times [2024-10-14 13:45:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505973235] [2024-10-14 13:45:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:15,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505973235] [2024-10-14 13:45:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505973235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:15,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:45:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814035514] [2024-10-14 13:45:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:15,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:45:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:45:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:45:15,121 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:45:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:15,514 INFO L93 Difference]: Finished difference Result 317 states and 452 transitions. [2024-10-14 13:45:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:45:15,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2024-10-14 13:45:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:15,518 INFO L225 Difference]: With dead ends: 317 [2024-10-14 13:45:15,518 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 13:45:15,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:45:15,519 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 485 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:15,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 665 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:45:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 13:45:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2024-10-14 13:45:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 174 states have internal predecessors, (234), 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-10-14 13:45:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-10-14 13:45:15,543 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 122 [2024-10-14 13:45:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:15,543 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-10-14 13:45:15,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-14 13:45:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-10-14 13:45:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:45:15,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:15,546 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] [2024-10-14 13:45:15,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:45:15,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1766148665, now seen corresponding path program 1 times [2024-10-14 13:45:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572511588] [2024-10-14 13:45:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-14 13:45:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572511588] [2024-10-14 13:45:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572511588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151522189] [2024-10-14 13:45:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:17,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:45:17,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:45:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:18,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 13:45:18,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:18,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:18,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:19,160 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 19 treesize of output 11 [2024-10-14 13:45:19,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:19,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 13:45:19,275 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 17 treesize of output 9 [2024-10-14 13:45:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:45:19,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:19,876 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 40 treesize of output 36 [2024-10-14 13:45:20,284 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 35 [2024-10-14 13:45:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-10-14 13:45:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151522189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:45:20,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:45:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2024-10-14 13:45:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282459644] [2024-10-14 13:45:20,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:45:20,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 13:45:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 13:45:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2024-10-14 13:45:20,321 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 46 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 42 states have internal predecessors, (118), 17 states have call successors, (45), 5 states have call predecessors, (45), 8 states have return successors, (45), 11 states have call predecessors, (45), 17 states have call successors, (45) [2024-10-14 13:45:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:23,203 INFO L93 Difference]: Finished difference Result 453 states and 624 transitions. [2024-10-14 13:45:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 13:45:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 42 states have internal predecessors, (118), 17 states have call successors, (45), 5 states have call predecessors, (45), 8 states have return successors, (45), 11 states have call predecessors, (45), 17 states have call successors, (45) Word has length 122 [2024-10-14 13:45:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:23,207 INFO L225 Difference]: With dead ends: 453 [2024-10-14 13:45:23,207 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 13:45:23,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=830, Invalid=4140, Unknown=0, NotChecked=0, Total=4970 [2024-10-14 13:45:23,211 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1318 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:23,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1398 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 13:45:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 13:45:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 208. [2024-10-14 13:45:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 175 states have internal predecessors, (231), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 13:45:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 281 transitions. [2024-10-14 13:45:23,257 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 281 transitions. Word has length 122 [2024-10-14 13:45:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:23,258 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 281 transitions. [2024-10-14 13:45:23,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 42 states have internal predecessors, (118), 17 states have call successors, (45), 5 states have call predecessors, (45), 8 states have return successors, (45), 11 states have call predecessors, (45), 17 states have call successors, (45) [2024-10-14 13:45:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2024-10-14 13:45:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:45:23,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:23,261 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] [2024-10-14 13:45:23,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:45:23,461 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,SelfDestructingSolverStorable5 [2024-10-14 13:45:23,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1906697275, now seen corresponding path program 1 times [2024-10-14 13:45:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743248143] [2024-10-14 13:45:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:24,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743248143] [2024-10-14 13:45:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743248143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:24,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:24,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:45:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158974989] [2024-10-14 13:45:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:24,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:45:24,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:45:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:45:24,105 INFO L87 Difference]: Start difference. First operand 208 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:24,597 INFO L93 Difference]: Finished difference Result 432 states and 590 transitions. [2024-10-14 13:45:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:45:24,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-14 13:45:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:24,600 INFO L225 Difference]: With dead ends: 432 [2024-10-14 13:45:24,600 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 13:45:24,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-10-14 13:45:24,603 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 282 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:24,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 601 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:45:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 13:45:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2024-10-14 13:45:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 174 states have (on average 1.3275862068965518) internal successors, (231), 176 states have internal predecessors, (231), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 13:45:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 281 transitions. [2024-10-14 13:45:24,629 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 281 transitions. Word has length 122 [2024-10-14 13:45:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:24,629 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 281 transitions. [2024-10-14 13:45:24,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 281 transitions. [2024-10-14 13:45:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:45:24,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:24,631 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] [2024-10-14 13:45:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:45:24,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:24,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1319891261, now seen corresponding path program 1 times [2024-10-14 13:45:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377585058] [2024-10-14 13:45:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377585058] [2024-10-14 13:45:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377585058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:45:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453520337] [2024-10-14 13:45:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:45:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:45:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:45:24,918 INFO L87 Difference]: Start difference. First operand 209 states and 281 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10-14 13:45:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:25,049 INFO L93 Difference]: Finished difference Result 504 states and 677 transitions. [2024-10-14 13:45:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 122 [2024-10-14 13:45:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:25,051 INFO L225 Difference]: With dead ends: 504 [2024-10-14 13:45:25,051 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 13:45:25,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 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-10-14 13:45:25,052 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 103 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:25,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 806 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:45:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 13:45:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2024-10-14 13:45:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 215 states have internal predecessors, (286), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 13:45:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 344 transitions. [2024-10-14 13:45:25,083 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 344 transitions. Word has length 122 [2024-10-14 13:45:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 344 transitions. [2024-10-14 13:45:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-10-14 13:45:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 344 transitions. [2024-10-14 13:45:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 13:45:25,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:25,085 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] [2024-10-14 13:45:25,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:45:25,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:25,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 854037881, now seen corresponding path program 1 times [2024-10-14 13:45:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214428633] [2024-10-14 13:45:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:45:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214428633] [2024-10-14 13:45:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214428633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424642028] [2024-10-14 13:45:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:25,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:45:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:45:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:25,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:45:25,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:25,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:26,008 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 19 treesize of output 11 [2024-10-14 13:45:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-14 13:45:26,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:26,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 32 treesize of output 28 [2024-10-14 13:45:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:45:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424642028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:45:26,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:45:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2024-10-14 13:45:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829345567] [2024-10-14 13:45:26,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:45:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 13:45:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 13:45:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:45:26,236 INFO L87 Difference]: Start difference. First operand 254 states and 344 transitions. Second operand has 13 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-14 13:45:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:26,628 INFO L93 Difference]: Finished difference Result 407 states and 535 transitions. [2024-10-14 13:45:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:45:26,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) Word has length 122 [2024-10-14 13:45:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:26,630 INFO L225 Difference]: With dead ends: 407 [2024-10-14 13:45:26,630 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 13:45:26,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-14 13:45:26,631 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 291 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:26,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 525 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:45:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 13:45:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-10-14 13:45:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 122 states have internal predecessors, (148), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 13:45:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2024-10-14 13:45:26,668 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 122 [2024-10-14 13:45:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:26,669 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2024-10-14 13:45:26,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-14 13:45:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2024-10-14 13:45:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:45:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:26,670 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] [2024-10-14 13:45:26,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:45:26,871 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,SelfDestructingSolverStorable8 [2024-10-14 13:45:26,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:26,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash 833767012, now seen corresponding path program 1 times [2024-10-14 13:45:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220298357] [2024-10-14 13:45:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220298357] [2024-10-14 13:45:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220298357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:27,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:45:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096330030] [2024-10-14 13:45:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:27,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:45:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:45:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:45:27,185 INFO L87 Difference]: Start difference. First operand 158 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-14 13:45:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:27,284 INFO L93 Difference]: Finished difference Result 281 states and 356 transitions. [2024-10-14 13:45:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:45:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-10-14 13:45:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:27,288 INFO L225 Difference]: With dead ends: 281 [2024-10-14 13:45:27,288 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 13:45:27,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:45:27,289 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 80 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:27,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 434 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:45:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 13:45:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-14 13:45:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 124 states have internal predecessors, (150), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 13:45:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2024-10-14 13:45:27,312 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 124 [2024-10-14 13:45:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:27,312 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2024-10-14 13:45:27,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-14 13:45:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2024-10-14 13:45:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:45:27,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:27,314 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] [2024-10-14 13:45:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:45:27,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 776449128, now seen corresponding path program 1 times [2024-10-14 13:45:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958841835] [2024-10-14 13:45:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:45:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958841835] [2024-10-14 13:45:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958841835] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70149992] [2024-10-14 13:45:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:28,589 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-10-14 13:45:28,590 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-10-14 13:45:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:28,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 13:45:28,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:29,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:29,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:29,403 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 11 treesize of output 7 [2024-10-14 13:45:29,410 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 12 treesize of output 8 [2024-10-14 13:45:29,481 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 103 treesize of output 87 [2024-10-14 13:45:29,484 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 87 treesize of output 55 [2024-10-14 13:45:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 239 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-14 13:45:29,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70149992] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:45:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 8] total 21 [2024-10-14 13:45:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233084658] [2024-10-14 13:45:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:30,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:45:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:45:30,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:45:30,122 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-10-14 13:45:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:30,361 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2024-10-14 13:45:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:30,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 124 [2024-10-14 13:45:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:30,364 INFO L225 Difference]: With dead ends: 184 [2024-10-14 13:45:30,364 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 13:45:30,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-14 13:45:30,365 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 257 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:30,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 635 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:45:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 13:45:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2024-10-14 13:45:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 139 states have internal predecessors, (168), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:45:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2024-10-14 13:45:30,396 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 124 [2024-10-14 13:45:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:30,399 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2024-10-14 13:45:30,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-10-14 13:45:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2024-10-14 13:45:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:45:30,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:30,400 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] [2024-10-14 13:45:30,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 13:45:30,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:30,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 776508710, now seen corresponding path program 1 times [2024-10-14 13:45:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354681193] [2024-10-14 13:45:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354681193] [2024-10-14 13:45:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354681193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:45:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406140965] [2024-10-14 13:45:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:45:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:45:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:45:30,866 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-14 13:45:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:30,936 INFO L93 Difference]: Finished difference Result 307 states and 388 transitions. [2024-10-14 13:45:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:45:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-10-14 13:45:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:30,941 INFO L225 Difference]: With dead ends: 307 [2024-10-14 13:45:30,941 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 13:45:30,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:45:30,942 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 112 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:30,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 13:45:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2024-10-14 13:45:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 138 states have (on average 1.210144927536232) internal successors, (167), 139 states have internal predecessors, (167), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:45:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2024-10-14 13:45:30,973 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 124 [2024-10-14 13:45:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:30,973 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2024-10-14 13:45:30,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-10-14 13:45:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2024-10-14 13:45:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:45:30,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:30,974 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] [2024-10-14 13:45:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:45:30,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:30,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash 24420386, now seen corresponding path program 1 times [2024-10-14 13:45:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559894307] [2024-10-14 13:45:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559894307] [2024-10-14 13:45:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559894307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:45:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609674388] [2024-10-14 13:45:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:31,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:45:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:31,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:45:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:45:31,848 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:32,268 INFO L93 Difference]: Finished difference Result 376 states and 471 transitions. [2024-10-14 13:45:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:45:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-10-14 13:45:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:32,271 INFO L225 Difference]: With dead ends: 376 [2024-10-14 13:45:32,271 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 13:45:32,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:45:32,272 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 218 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:32,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 607 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:45:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 13:45:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 198. [2024-10-14 13:45:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 156 states have internal predecessors, (189), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:45:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2024-10-14 13:45:32,326 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 124 [2024-10-14 13:45:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2024-10-14 13:45:32,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2024-10-14 13:45:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:45:32,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:32,329 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] [2024-10-14 13:45:32,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:45:32,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:32,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:32,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1812020291, now seen corresponding path program 1 times [2024-10-14 13:45:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596509689] [2024-10-14 13:45:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:32,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-10-14 13:45:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596509689] [2024-10-14 13:45:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596509689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:32,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:45:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781287155] [2024-10-14 13:45:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:45:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:45:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:45:32,653 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:32,810 INFO L93 Difference]: Finished difference Result 340 states and 429 transitions. [2024-10-14 13:45:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:45:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-14 13:45:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:32,812 INFO L225 Difference]: With dead ends: 340 [2024-10-14 13:45:32,812 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 13:45:32,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:45:32,814 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 198 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:32,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 234 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:45:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 13:45:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-14 13:45:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 156 states have internal predecessors, (188), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:45:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2024-10-14 13:45:32,868 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 126 [2024-10-14 13:45:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:32,870 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2024-10-14 13:45:32,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:45:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2024-10-14 13:45:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:45:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:32,871 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] [2024-10-14 13:45:32,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:45:32,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 6581957, now seen corresponding path program 1 times [2024-10-14 13:45:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963717973] [2024-10-14 13:45:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:45:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963717973] [2024-10-14 13:45:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963717973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262358255] [2024-10-14 13:45:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:33,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:33,851 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-10-14 13:45:33,852 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-10-14 13:45:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:34,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 13:45:34,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:34,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:35,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 13:45:35,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:36,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-14 13:45:36,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:36,362 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 27 treesize of output 15 [2024-10-14 13:45:36,433 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 17 treesize of output 9 [2024-10-14 13:45:36,499 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 22 treesize of output 10 [2024-10-14 13:45:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 334 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-14 13:45:36,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:37,202 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 60 treesize of output 56 [2024-10-14 13:45:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262358255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:38,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:45:38,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 38 [2024-10-14 13:45:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745505068] [2024-10-14 13:45:38,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:45:38,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 13:45:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 13:45:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2629, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 13:45:38,615 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 38 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 12 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 12 states have call successors, (30) [2024-10-14 13:45:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:43,039 INFO L93 Difference]: Finished difference Result 507 states and 625 transitions. [2024-10-14 13:45:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-14 13:45:43,039 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 12 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 12 states have call successors, (30) Word has length 126 [2024-10-14 13:45:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:43,041 INFO L225 Difference]: With dead ends: 507 [2024-10-14 13:45:43,041 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 13:45:43,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3745 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2469, Invalid=11337, Unknown=0, NotChecked=0, Total=13806 [2024-10-14 13:45:43,046 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1355 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:43,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1631 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 13:45:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 13:45:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 350. [2024-10-14 13:45:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 283 states have (on average 1.215547703180212) internal successors, (344), 284 states have internal predecessors, (344), 43 states have call successors, (43), 23 states have call predecessors, (43), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:45:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 430 transitions. [2024-10-14 13:45:43,111 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 430 transitions. Word has length 126 [2024-10-14 13:45:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:43,111 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 430 transitions. [2024-10-14 13:45:43,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 12 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 12 states have call successors, (30) [2024-10-14 13:45:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 430 transitions. [2024-10-14 13:45:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:45:43,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:43,113 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] [2024-10-14 13:45:43,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 13:45:43,316 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,SelfDestructingSolverStorable14 [2024-10-14 13:45:43,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 967904616, now seen corresponding path program 1 times [2024-10-14 13:45:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676269330] [2024-10-14 13:45:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:45:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:45:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:45:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:45:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:45:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:45:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:45:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:45:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:45:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:45:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:45:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:45:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:45:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:45:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:45:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:43,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:43,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676269330] [2024-10-14 13:45:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676269330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:45:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627460286] [2024-10-14 13:45:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:43,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:45:43,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:45:43,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:45:43,528 INFO L87 Difference]: Start difference. First operand 350 states and 430 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10-14 13:45:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:43,640 INFO L93 Difference]: Finished difference Result 574 states and 702 transitions. [2024-10-14 13:45:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 128 [2024-10-14 13:45:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:43,643 INFO L225 Difference]: With dead ends: 574 [2024-10-14 13:45:43,643 INFO L226 Difference]: Without dead ends: 358 [2024-10-14 13:45:43,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:45:43,645 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:43,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-14 13:45:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 352. [2024-10-14 13:45:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 285 states have (on average 1.2140350877192982) internal successors, (346), 286 states have internal predecessors, (346), 43 states have call successors, (43), 23 states have call predecessors, (43), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:45:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 432 transitions. [2024-10-14 13:45:43,719 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 432 transitions. Word has length 128 [2024-10-14 13:45:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 432 transitions. [2024-10-14 13:45:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10-14 13:45:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 432 transitions. [2024-10-14 13:45:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:45:43,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:43,721 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] [2024-10-14 13:45:43,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:45:43,722 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1504500042, now seen corresponding path program 1 times [2024-10-14 13:45:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:43,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955172409] [2024-10-14 13:45:43,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:45:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528911879] [2024-10-14 13:45:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:43,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:43,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:43,819 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-10-14 13:45:43,820 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-10-14 13:45:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:44,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 13:45:44,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:44,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:44,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:44,586 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 11 [2024-10-14 13:45:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-14 13:45:44,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955172409] [2024-10-14 13:45:44,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:45:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528911879] [2024-10-14 13:45:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528911879] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:45:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-14 13:45:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24891763] [2024-10-14 13:45:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:44,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:45:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:44,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:45:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:45:44,933 INFO L87 Difference]: Start difference. First operand 352 states and 432 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10-14 13:45:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:45,341 INFO L93 Difference]: Finished difference Result 797 states and 987 transitions. [2024-10-14 13:45:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:45,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 130 [2024-10-14 13:45:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:45,348 INFO L225 Difference]: With dead ends: 797 [2024-10-14 13:45:45,348 INFO L226 Difference]: Without dead ends: 542 [2024-10-14 13:45:45,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:45:45,349 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 219 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:45,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 415 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:45:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-14 13:45:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 364. [2024-10-14 13:45:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 297 states have (on average 1.2188552188552189) internal successors, (362), 298 states have internal predecessors, (362), 43 states have call successors, (43), 23 states have call predecessors, (43), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:45:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 448 transitions. [2024-10-14 13:45:45,423 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 448 transitions. Word has length 130 [2024-10-14 13:45:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:45,423 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 448 transitions. [2024-10-14 13:45:45,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10-14 13:45:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 448 transitions. [2024-10-14 13:45:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:45:45,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:45,425 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] [2024-10-14 13:45:45,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 13:45:45,628 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,SelfDestructingSolverStorable16 [2024-10-14 13:45:45,629 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1363951432, now seen corresponding path program 1 times [2024-10-14 13:45:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:45,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142129014] [2024-10-14 13:45:45,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:45:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593240917] [2024-10-14 13:45:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:45,700 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:45:45,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 13:45:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:46,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 13:45:46,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:46,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:46,642 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-14 13:45:46,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2024-10-14 13:45:46,744 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 11 [2024-10-14 13:45:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 31 proven. 245 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:45:46,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142129014] [2024-10-14 13:45:47,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:45:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593240917] [2024-10-14 13:45:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593240917] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:45:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-10-14 13:45:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863102167] [2024-10-14 13:45:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:45:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:45:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-14 13:45:47,139 INFO L87 Difference]: Start difference. First operand 364 states and 448 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10-14 13:45:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:47,652 INFO L93 Difference]: Finished difference Result 765 states and 941 transitions. [2024-10-14 13:45:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 130 [2024-10-14 13:45:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:47,657 INFO L225 Difference]: With dead ends: 765 [2024-10-14 13:45:47,657 INFO L226 Difference]: Without dead ends: 498 [2024-10-14 13:45:47,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:45:47,659 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:47,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 472 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:45:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-10-14 13:45:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 358. [2024-10-14 13:45:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 291 states have (on average 1.2164948453608246) internal successors, (354), 292 states have internal predecessors, (354), 43 states have call successors, (43), 23 states have call predecessors, (43), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:45:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 440 transitions. [2024-10-14 13:45:47,731 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 440 transitions. Word has length 130 [2024-10-14 13:45:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:47,733 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 440 transitions. [2024-10-14 13:45:47,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10-14 13:45:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 440 transitions. [2024-10-14 13:45:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:45:47,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:47,734 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] [2024-10-14 13:45:47,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 13:45:47,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 13:45:47,935 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:47,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1481867788, now seen corresponding path program 1 times [2024-10-14 13:45:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:47,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704189782] [2024-10-14 13:45:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:45:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927344282] [2024-10-14 13:45:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:48,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:45:48,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 13:45:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:48,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 13:45:48,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:48,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:45:48,932 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-14 13:45:48,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2024-10-14 13:45:49,005 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 11 [2024-10-14 13:45:49,062 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 33 treesize of output 17 [2024-10-14 13:45:49,115 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 33 treesize of output 17 [2024-10-14 13:45:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:45:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 13:45:49,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:45:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:45:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:45:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704189782] [2024-10-14 13:45:49,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:45:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927344282] [2024-10-14 13:45:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927344282] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:45:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:45:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-10-14 13:45:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216441800] [2024-10-14 13:45:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:45:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:45:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:45:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-14 13:45:49,747 INFO L87 Difference]: Start difference. First operand 358 states and 440 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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-10-14 13:45:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:50,237 INFO L93 Difference]: Finished difference Result 617 states and 758 transitions. [2024-10-14 13:45:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:45:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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 130 [2024-10-14 13:45:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:50,240 INFO L225 Difference]: With dead ends: 617 [2024-10-14 13:45:50,241 INFO L226 Difference]: Without dead ends: 362 [2024-10-14 13:45:50,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-14 13:45:50,242 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 243 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:50,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 604 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:45:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-14 13:45:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-10-14 13:45:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 295 states have (on average 1.2135593220338983) internal successors, (358), 296 states have internal predecessors, (358), 43 states have call successors, (43), 23 states have call predecessors, (43), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 13:45:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 444 transitions. [2024-10-14 13:45:50,318 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 444 transitions. Word has length 130 [2024-10-14 13:45:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 444 transitions. [2024-10-14 13:45:50,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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-10-14 13:45:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 444 transitions. [2024-10-14 13:45:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:45:50,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:50,320 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] [2024-10-14 13:45:50,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 13:45:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:50,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:50,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1124155766, now seen corresponding path program 1 times [2024-10-14 13:45:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:45:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138911209] [2024-10-14 13:45:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:45:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:45:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331609891] [2024-10-14 13:45:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:50,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:50,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:50,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:45:50,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 13:45:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:45:51,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:45:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:45:51,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:45:51,537 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:45:51,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:45:51,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 13:45:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:45:51,743 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] [2024-10-14 13:45:51,929 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:45:51,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:45:51 BoogieIcfgContainer [2024-10-14 13:45:51,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:45:51,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:45:51,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:45:51,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:45:51,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:11" (3/4) ... [2024-10-14 13:45:51,936 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:45:51,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:45:51,938 INFO L158 Benchmark]: Toolchain (without parser) took 42025.64ms. Allocated memory was 151.0MB in the beginning and 635.4MB in the end (delta: 484.4MB). Free memory was 112.4MB in the beginning and 338.1MB in the end (delta: -225.7MB). Peak memory consumption was 258.3MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,938 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:45:51,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.11ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 97.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.48ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,939 INFO L158 Benchmark]: Boogie Preprocessor took 127.92ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 87.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,942 INFO L158 Benchmark]: RCFGBuilder took 990.81ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 84.8MB in the end (delta: 3.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,942 INFO L158 Benchmark]: TraceAbstraction took 40447.09ms. Allocated memory was 151.0MB in the beginning and 635.4MB in the end (delta: 484.4MB). Free memory was 84.8MB in the beginning and 338.1MB in the end (delta: -253.3MB). Peak memory consumption was 233.9MB. Max. memory is 16.1GB. [2024-10-14 13:45:51,942 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 635.4MB. Free memory is still 338.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:45:51,943 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.11ms. Allocated memory is still 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.11ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 97.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.48ms. Allocated memory is still 151.0MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.92ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 87.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 990.81ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 84.8MB in the end (delta: 3.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40447.09ms. Allocated memory was 151.0MB in the beginning and 635.4MB in the end (delta: 484.4MB). Free memory was 84.8MB in the beginning and 338.1MB in the end (delta: -253.3MB). Peak memory consumption was 233.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 635.4MB. Free memory is still 338.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L22] unsigned char var_1_1 = 8; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_2 = 59049; [L25] unsigned short int* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 100; [L26] unsigned short int var_1_3 = 100; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_7 = -25; [L30] signed char var_1_7 = -25; [L31] signed char* var_1_7_Pointer = &(var_1_7); [L32] signed char var_1_8 = 16; [L32] signed char var_1_8 = 16; [L33] signed char* var_1_8_Pointer = &(var_1_8); [L34] signed char var_1_9 = 25; [L34] signed char var_1_9 = 25; [L35] signed char* var_1_9_Pointer = &(var_1_9); [L36] signed char var_1_10 = -10; [L36] signed char var_1_10 = -10; [L37] signed char* var_1_10_Pointer = &(var_1_10); [L38] signed char var_1_11 = 0; [L38] signed char var_1_11 = 0; [L39] signed char* var_1_11_Pointer = &(var_1_11); [L40] float var_1_12 = 25.1; [L40] float var_1_12 = 25.1; [L41] float* var_1_12_Pointer = &(var_1_12); [L42] unsigned long int var_1_13 = 2531521428; [L42] unsigned long int var_1_13 = 2531521428; [L43] unsigned long int* var_1_13_Pointer = &(var_1_13); [L44] signed long int var_1_14 = -128; [L44] signed long int var_1_14 = -128; [L45] signed long int* var_1_14_Pointer = &(var_1_14); [L46] signed long int var_1_15 = 256; [L46] signed long int var_1_15 = 256; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_16 = -16; [L48] signed short int var_1_16 = -16; [L49] signed short int* var_1_16_Pointer = &(var_1_16); [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L77] var_1_2 = __VERIFIER_nondet_ushort() [L78] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_2 >= 32767) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_2 >= 32767) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_2 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_2 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_3) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3 <= 32767) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_3 <= 32767) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_6 = __VERIFIER_nondet_uchar() [L84] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_6 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_6 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_6 <= 254) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_6 <= 254) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_8 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_8) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_8 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_8 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_8) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_8 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_8 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_9 = __VERIFIER_nondet_char() [L90] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_9 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_9 >= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_9) VAL [isInitial=1, 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 <= 31) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 <= 31) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_10 = __VERIFIER_nondet_char() [L93] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_10 >= -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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_10 >= -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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_10) VAL [isInitial=1, 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 <= 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 = __VERIFIER_nondet_float() [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_12 >= -922337.2036854776000e+13F && 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L97] var_1_13 = __VERIFIER_nondet_ulong() [L98] EXPR \read(var_1_13) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L98] CALL assume_abort_if_not(var_1_13 >= 2147483647) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L98] RET assume_abort_if_not(var_1_13 >= 2147483647) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L99] EXPR \read(var_1_13) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L99] CALL assume_abort_if_not(var_1_13 <= 4294967295) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L99] RET assume_abort_if_not(var_1_13 <= 4294967295) 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_8_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_8_Pointer)) [L54] EXPR \read(*var_1_14_Pointer) [L54] (*(var_1_16_Pointer)) = (*(var_1_14_Pointer)) [L55] EXPR \read(*var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L55] signed long int stepLocal_0 = ((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))); [L56] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_2_Pointer)) <= stepLocal_0) [L59] EXPR \read(*var_1_10_Pointer) [L59] (*(var_1_7_Pointer)) = (*(var_1_10_Pointer)) [L61] EXPR \read(*var_1_16_Pointer) [L61] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_15_Pointer) [L62] EXPR \read(*var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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 ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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] COND FALSE !((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L67] EXPR \read(*var_1_1_Pointer) [L67] unsigned char stepLocal_1 = (*(var_1_1_Pointer)); [L68] EXPR \read(*var_1_12_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L68] COND FALSE !(2.75f > (*(var_1_12_Pointer))) [L71] EXPR \read(*var_1_13_Pointer) [L71] EXPR \read(*var_1_14_Pointer) [L71] EXPR \read(*var_1_8_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, stepLocal_1=17, 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L71] COND TRUE ((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > stepLocal_1 [L72] EXPR \read(*var_1_8_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L72] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))) [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L72] (*(var_1_11_Pointer)) = (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_6_Pointer) [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) [L104] EXPR \read(*var_1_12_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1) [L104] EXPR \read(*var_1_11_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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}] [L104-L105] return (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) ; [L114] RET, EXPR property() [L114] 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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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_16={17:0}, var_1_16_Pointer={17: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_3={6:0}, var_1_3_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, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.2s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5560 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5560 mSDsluCounter, 11752 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9216 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5015 IncrementalHoareTripleChecker+Invalid, 5964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 2536 mSDtfsCounter, 5015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2486 GetRequests, 2142 SyntacticMatches, 1 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4725 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=17, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 533 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 3496 NumberOfCodeBlocks, 3496 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3575 ConstructedInterpolants, 189 QuantifiedInterpolants, 23593 SizeOfPredicates, 99 NumberOfNonLiveVariables, 4293 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 10224/12180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 13:45:52,029 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:45:54,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:45:54,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:45:54,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:45:54,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:45:54,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:45:54,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:45:54,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:45:54,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:45:54,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:45:54,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:45:54,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:45:54,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:45:54,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:45:54,325 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:45:54,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:45:54,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:45:54,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:45:54,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:45:54,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:45:54,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:45:54,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:45:54,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:45:54,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:45:54,332 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:45:54,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:45:54,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:45:54,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:45:54,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:45:54,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:45:54,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:45:54,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:45:54,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:45:54,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:45:54,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:45:54,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:45:54,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:45:54,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:45:54,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:45:54,338 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:45:54,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:45:54,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:45:54,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:45:54,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:45:54,340 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:45:54,340 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2024-10-14 13:45:54,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:45:54,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:45:54,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:45:54,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:45:54,707 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:45:54,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:56,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:45:56,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:45:56,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:56,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877d232ed/4d8e9414cede4498a769350677a344e5/FLAG287ee5aad [2024-10-14 13:45:56,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877d232ed/4d8e9414cede4498a769350677a344e5 [2024-10-14 13:45:56,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:45:56,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:45:56,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:45:56,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:45:56,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:45:56,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:56" (1/1) ... [2024-10-14 13:45:56,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4395009c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:56, skipping insertion in model container [2024-10-14 13:45:56,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:56" (1/1) ... [2024-10-14 13:45:56,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:45:57,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2024-10-14 13:45:57,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:45:57,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:45:57,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i[916,929] [2024-10-14 13:45:57,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:45:57,267 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:45:57,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57 WrapperNode [2024-10-14 13:45:57,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:45:57,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:45:57,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:45:57,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:45:57,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,342 INFO L138 Inliner]: procedures = 36, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-10-14 13:45:57,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:45:57,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:45:57,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:45:57,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:45:57,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,410 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-10-14 13:45:57,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:45:57,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:45:57,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:45:57,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:45:57,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (1/1) ... [2024-10-14 13:45:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:45:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:45:57,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:45:57,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:45:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:45:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:45:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-14 13:45:57,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:45:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-14 13:45:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-14 13:45:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:45:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-14 13:45:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:45:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:45:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-14 13:45:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:45:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-14 13:45:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:45:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-14 13:45:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:45:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-14 13:45:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-14 13:45:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:45:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:45:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-14 13:45:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:45:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:45:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:45:57,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-14 13:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-14 13:45:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-14 13:45:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-14 13:45:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:45:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-14 13:45:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-14 13:45:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-14 13:45:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-14 13:45:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-14 13:45:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-14 13:45:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-14 13:45:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-10-14 13:45:57,837 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:45:57,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:45:58,457 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-14 13:45:58,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:45:58,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:45:58,541 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:45:58,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:58 BoogieIcfgContainer [2024-10-14 13:45:58,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:45:58,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:45:58,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:45:58,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:45:58,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:45:56" (1/3) ... [2024-10-14 13:45:58,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:58, skipping insertion in model container [2024-10-14 13:45:58,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:57" (2/3) ... [2024-10-14 13:45:58,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:58, skipping insertion in model container [2024-10-14 13:45:58,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:58" (3/3) ... [2024-10-14 13:45:58,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2024-10-14 13:45:58,569 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:45:58,569 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:45:58,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:45:58,649 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;@2c3affd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:45:58,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:45:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 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-10-14 13:45:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:45:58,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:58,670 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] [2024-10-14 13:45:58,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1175078243, now seen corresponding path program 1 times [2024-10-14 13:45:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:45:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521305697] [2024-10-14 13:45:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:58,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:45:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:45:58,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:45:58,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:45:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:59,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:45:59,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:45:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-14 13:45:59,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:45:59,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:45:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521305697] [2024-10-14 13:45:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521305697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:45:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:45:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:45:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829836529] [2024-10-14 13:45:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:45:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:45:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:45:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:45:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:45:59,214 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10-14 13:45:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:45:59,258 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2024-10-14 13:45:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:45:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 117 [2024-10-14 13:45:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:45:59,271 INFO L225 Difference]: With dead ends: 177 [2024-10-14 13:45:59,271 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 13:45:59,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:45:59,279 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:45:59,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:45:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 13:45:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 13:45:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 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-10-14 13:45:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-14 13:45:59,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2024-10-14 13:45:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:45:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-14 13:45:59,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10-14 13:45:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-14 13:45:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:45:59,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:45:59,338 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] [2024-10-14 13:45:59,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:45:59,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:45:59,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:45:59,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:45:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 636026095, now seen corresponding path program 1 times [2024-10-14 13:45:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:45:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376161470] [2024-10-14 13:45:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:45:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:45:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:45:59,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:45:59,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:45:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:45:59,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:45:59,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:01,042 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 27 treesize of output 19 [2024-10-14 13:46:01,067 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 13 treesize of output 9 [2024-10-14 13:46:01,194 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 17 treesize of output 9 [2024-10-14 13:46:01,265 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 18 treesize of output 10 [2024-10-14 13:46:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-14 13:46:01,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:46:01,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:46:01,765 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 27 treesize of output 30 [2024-10-14 13:46:01,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:46:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376161470] [2024-10-14 13:46:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376161470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:46:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1950357699] [2024-10-14 13:46:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:46:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:46:01,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:46:01,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 13:46:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:02,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:46:02,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:46:02,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:46:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1950357699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:46:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:46:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-14 13:46:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129338344] [2024-10-14 13:46:02,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:46:02,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:46:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:46:02,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:46:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:02,314 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:46:02,380 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2024-10-14 13:46:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:46:02,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 117 [2024-10-14 13:46:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:46:02,383 INFO L225 Difference]: With dead ends: 178 [2024-10-14 13:46:02,383 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 13:46:02,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:02,385 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:46:02,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:46:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 13:46:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-14 13:46:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-10-14 13:46:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2024-10-14 13:46:02,395 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 117 [2024-10-14 13:46:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:46:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2024-10-14 13:46:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2024-10-14 13:46:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:46:02,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:46:02,399 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] [2024-10-14 13:46:02,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-14 13:46:02,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 13:46:02,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:46:02,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:46:02,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:46:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -173320531, now seen corresponding path program 1 times [2024-10-14 13:46:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:46:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455641992] [2024-10-14 13:46:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:46:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:46:02,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:46:02,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:46:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:03,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:46:03,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:04,008 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 27 treesize of output 19 [2024-10-14 13:46:04,012 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 13 treesize of output 9 [2024-10-14 13:46:04,072 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 17 treesize of output 9 [2024-10-14 13:46:04,129 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 18 treesize of output 10 [2024-10-14 13:46:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-14 13:46:04,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:46:04,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:46:04,572 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 27 treesize of output 30 [2024-10-14 13:46:04,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:46:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455641992] [2024-10-14 13:46:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455641992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:46:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1892610062] [2024-10-14 13:46:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:46:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:46:04,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:46:04,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 13:46:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:04,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:46:04,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:46:05,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:46:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1892610062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:46:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:46:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-14 13:46:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628364930] [2024-10-14 13:46:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:46:05,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:46:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:46:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:46:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:05,054 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:46:05,108 INFO L93 Difference]: Finished difference Result 182 states and 263 transitions. [2024-10-14 13:46:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:46:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 117 [2024-10-14 13:46:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:46:05,114 INFO L225 Difference]: With dead ends: 182 [2024-10-14 13:46:05,115 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:46:05,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:05,120 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:46:05,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 357 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:46:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:46:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-14 13:46:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 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-10-14 13:46:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-14 13:46:05,134 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2024-10-14 13:46:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:46:05,138 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-14 13:46:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-14 13:46:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:46:05,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:46:05,140 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] [2024-10-14 13:46:05,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-14 13:46:05,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 13:46:05,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:46:05,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:46:05,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:46:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash -116062229, now seen corresponding path program 1 times [2024-10-14 13:46:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:46:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628356758] [2024-10-14 13:46:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:46:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:46:05,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:46:05,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 13:46:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:05,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:46:05,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:06,635 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 27 treesize of output 19 [2024-10-14 13:46:06,639 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 13 treesize of output 9 [2024-10-14 13:46:06,691 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 17 treesize of output 9 [2024-10-14 13:46:06,747 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 18 treesize of output 10 [2024-10-14 13:46:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-14 13:46:06,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:46:07,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:46:07,108 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 27 treesize of output 30 [2024-10-14 13:46:07,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:46:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628356758] [2024-10-14 13:46:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628356758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:46:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1371366955] [2024-10-14 13:46:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:46:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:46:07,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:46:07,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 13:46:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:07,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:46:07,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:46:07,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:46:07,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1371366955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:46:07,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:46:07,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-14 13:46:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887790391] [2024-10-14 13:46:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:46:07,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:46:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:46:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:46:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:07,422 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:46:07,465 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-14 13:46:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:46:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 117 [2024-10-14 13:46:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:46:07,469 INFO L225 Difference]: With dead ends: 186 [2024-10-14 13:46:07,469 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 13:46:07,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:46:07,471 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:46:07,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:46:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 13:46:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-14 13:46:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 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-10-14 13:46:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-14 13:46:07,486 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2024-10-14 13:46:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:46:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-14 13:46:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 13:46:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-14 13:46:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:46:07,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:46:07,489 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] [2024-10-14 13:46:07,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 13:46:07,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-14 13:46:07,890 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 13:46:07,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:46:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:46:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -116002647, now seen corresponding path program 1 times [2024-10-14 13:46:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:46:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166838461] [2024-10-14 13:46:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:46:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:46:07,895 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-10-14 13:46:07,896 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-10-14 13:46:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:08,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:46:08,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:08,894 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 27 treesize of output 19 [2024-10-14 13:46:08,898 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 13 treesize of output 9 [2024-10-14 13:46:08,951 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 17 treesize of output 9 [2024-10-14 13:46:08,998 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 18 treesize of output 10 [2024-10-14 13:46:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-14 13:46:09,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:46:09,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:46:09,346 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 27 treesize of output 30 [2024-10-14 13:46:09,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:46:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166838461] [2024-10-14 13:46:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166838461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:46:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [224232791] [2024-10-14 13:46:09,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:46:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:46:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:46:09,449 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:46:09,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-14 13:46:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:46:09,681 WARN L253 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-10-14 13:46:09,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:46:10,838 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