./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:46:49,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:46:49,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:46:49,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:46:49,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:46:49,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:46:49,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:46:49,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:46:49,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:46:49,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:46:49,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:46:49,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:46:49,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:46:49,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:46:49,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:46:49,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:46:49,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:46:49,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:46:49,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:46:49,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:46:49,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:46:49,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:46:49,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:46:49,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:46:49,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:46:49,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:46:49,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:46:49,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:46:49,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:46:49,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-07 10:46:50,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:46:50,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:46:50,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:46:50,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:46:50,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:46:50,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:46:51,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:46:51,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:46:51,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:46:51,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e5e5a4c/0f8cdea774614b5093ee48b34e246170/FLAGcb3b32a99 [2024-11-07 10:46:51,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e5e5a4c/0f8cdea774614b5093ee48b34e246170 [2024-11-07 10:46:51,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:46:51,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:46:51,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:46:51,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:46:51,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:46:51,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1565d2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51, skipping insertion in model container [2024-11-07 10:46:51,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:46:51,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-07 10:46:51,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:46:51,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:46:51,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-07 10:46:51,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:46:51,890 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:46:51,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51 WrapperNode [2024-11-07 10:46:51,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:46:51,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:46:51,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:46:51,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:46:51,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,974 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-07 10:46:51,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:46:51,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:46:51,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:46:51,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:46:51,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:51,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,007 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:46:52,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:46:52,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:46:52,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:46:52,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:46:52,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (1/1) ... [2024-11-07 10:46:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:46:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:46:52,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:46:52,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:46:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:46:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:46:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:46:52,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:46:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:46:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:46:52,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:46:52,241 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:46:52,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:46:52,887 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-07 10:46:52,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:46:52,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:46:52,898 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:46:52,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:46:52 BoogieIcfgContainer [2024-11-07 10:46:52,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:46:52,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:46:52,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:46:52,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:46:52,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:46:51" (1/3) ... [2024-11-07 10:46:52,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c78f30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:46:52, skipping insertion in model container [2024-11-07 10:46:52,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:46:51" (2/3) ... [2024-11-07 10:46:52,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c78f30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:46:52, skipping insertion in model container [2024-11-07 10:46:52,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:46:52" (3/3) ... [2024-11-07 10:46:52,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:46:52,918 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:46:52,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:46:52,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:46:52,976 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;@7ef1dca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:46:52,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:46:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:46:52,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:52,992 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:52,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2024-11-07 10:46:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:53,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062126540] [2024-11-07 10:46:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:53,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:53,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062126540] [2024-11-07 10:46:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062126540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:53,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:53,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:46:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615460742] [2024-11-07 10:46:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:53,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:46:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:46:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:46:53,372 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:46:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:53,399 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-07 10:46:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:46:53,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-07 10:46:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:53,410 INFO L225 Difference]: With dead ends: 213 [2024-11-07 10:46:53,410 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:46:53,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:46:53,417 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:46:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:46:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 10:46:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-07 10:46:53,464 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-07 10:46:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:53,465 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-07 10:46:53,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:46:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-07 10:46:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:46:53,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:53,469 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:53,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:46:53,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1914200370, now seen corresponding path program 1 times [2024-11-07 10:46:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583772854] [2024-11-07 10:46:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:53,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583772854] [2024-11-07 10:46:53,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583772854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:53,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:46:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755982362] [2024-11-07 10:46:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:53,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:46:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:53,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:46:53,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:53,994 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:54,048 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-07 10:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:46:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-07 10:46:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:54,050 INFO L225 Difference]: With dead ends: 211 [2024-11-07 10:46:54,050 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 10:46:54,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:54,053 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:54,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:46:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 10:46:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 10:46:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-07 10:46:54,067 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-07 10:46:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:54,068 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-07 10:46:54,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-07 10:46:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:46:54,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:54,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:54,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:46:54,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash -314773303, now seen corresponding path program 1 times [2024-11-07 10:46:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769783929] [2024-11-07 10:46:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769783929] [2024-11-07 10:46:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769783929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:46:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191421784] [2024-11-07 10:46:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:46:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:46:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:54,328 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:54,371 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-07 10:46:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:46:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:46:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:54,375 INFO L225 Difference]: With dead ends: 216 [2024-11-07 10:46:54,377 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:46:54,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:54,378 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:54,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:46:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:46:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-07 10:46:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-07 10:46:54,396 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 107 [2024-11-07 10:46:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-07 10:46:54,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-07 10:46:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:46:54,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:54,402 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:54,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:46:54,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1460234059, now seen corresponding path program 1 times [2024-11-07 10:46:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613427276] [2024-11-07 10:46:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613427276] [2024-11-07 10:46:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613427276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:46:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048996585] [2024-11-07 10:46:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:54,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:46:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:54,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:46:54,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:54,608 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:54,641 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-11-07 10:46:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:46:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:46:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:54,644 INFO L225 Difference]: With dead ends: 220 [2024-11-07 10:46:54,644 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:46:54,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:54,648 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:54,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:46:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:46:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 10:46:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-07 10:46:54,660 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-07 10:46:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-07 10:46:54,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-07 10:46:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:46:54,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:54,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:46:54,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1462081101, now seen corresponding path program 1 times [2024-11-07 10:46:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337817136] [2024-11-07 10:46:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:54,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:55,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337817136] [2024-11-07 10:46:55,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337817136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:55,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:55,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:46:55,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123120427] [2024-11-07 10:46:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:55,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:46:55,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:55,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:46:55,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:46:55,346 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:55,775 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2024-11-07 10:46:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:46:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:46:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:55,777 INFO L225 Difference]: With dead ends: 323 [2024-11-07 10:46:55,777 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 10:46:55,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:46:55,779 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 125 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:55,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 302 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:46:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 10:46:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-07 10:46:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:46:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-07 10:46:55,802 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2024-11-07 10:46:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:55,803 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-07 10:46:55,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-07 10:46:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:46:55,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:55,804 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:46:55,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 544621908, now seen corresponding path program 1 times [2024-11-07 10:46:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61242932] [2024-11-07 10:46:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61242932] [2024-11-07 10:46:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61242932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:46:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937712118] [2024-11-07 10:46:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:46:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:46:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:46:56,951 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:57,220 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2024-11-07 10:46:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:46:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-07 10:46:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:57,223 INFO L225 Difference]: With dead ends: 368 [2024-11-07 10:46:57,223 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 10:46:57,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:46:57,225 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 103 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:57,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 249 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:46:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 10:46:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-07 10:46:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:46:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2024-11-07 10:46:57,243 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2024-11-07 10:46:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:57,243 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2024-11-07 10:46:57,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2024-11-07 10:46:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:46:57,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:57,249 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:57,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:46:57,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash -273026542, now seen corresponding path program 1 times [2024-11-07 10:46:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061530575] [2024-11-07 10:46:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061530575] [2024-11-07 10:46:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061530575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:46:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533032709] [2024-11-07 10:46:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:58,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:46:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:46:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:46:58,413 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:46:58,796 INFO L93 Difference]: Finished difference Result 469 states and 681 transitions. [2024-11-07 10:46:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:46:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-07 10:46:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:46:58,798 INFO L225 Difference]: With dead ends: 469 [2024-11-07 10:46:58,799 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 10:46:58,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:46:58,800 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 96 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:46:58,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 304 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:46:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 10:46:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-07 10:46:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:46:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2024-11-07 10:46:58,825 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 108 [2024-11-07 10:46:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:46:58,827 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2024-11-07 10:46:58,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:46:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2024-11-07 10:46:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:46:58,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:46:58,828 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:46:58,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:46:58,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:46:58,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:46:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash -859832556, now seen corresponding path program 1 times [2024-11-07 10:46:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:46:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504030157] [2024-11-07 10:46:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:46:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:46:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:46:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:46:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:46:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:46:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:46:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:46:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:46:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:46:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:46:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:46:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:46:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:46:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:46:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:46:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:46:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504030157] [2024-11-07 10:46:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504030157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:46:59,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:46:59,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:46:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842441428] [2024-11-07 10:46:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:46:59,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:46:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:46:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:46:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:46:59,870 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:47:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:00,352 INFO L93 Difference]: Finished difference Result 595 states and 850 transitions. [2024-11-07 10:47:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:47:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-07 10:47:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:00,356 INFO L225 Difference]: With dead ends: 595 [2024-11-07 10:47:00,356 INFO L226 Difference]: Without dead ends: 364 [2024-11-07 10:47:00,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:47:00,357 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 77 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:00,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 664 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:47:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-07 10:47:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2024-11-07 10:47:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.3699059561128526) internal successors, (437), 321 states have internal predecessors, (437), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:47:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 509 transitions. [2024-11-07 10:47:00,398 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 509 transitions. Word has length 108 [2024-11-07 10:47:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 509 transitions. [2024-11-07 10:47:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.5) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:47:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 509 transitions. [2024-11-07 10:47:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:47:00,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:00,401 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:47:00,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1112397672, now seen corresponding path program 1 times [2024-11-07 10:47:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042072460] [2024-11-07 10:47:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:47:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:47:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:47:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:47:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:47:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:47:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:47:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:01,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042072460] [2024-11-07 10:47:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042072460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:01,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:47:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438794732] [2024-11-07 10:47:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:01,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:47:01,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:47:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:47:01,180 INFO L87 Difference]: Start difference. First operand 360 states and 509 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:02,253 INFO L93 Difference]: Finished difference Result 760 states and 1081 transitions. [2024-11-07 10:47:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:47:02,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:47:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:02,258 INFO L225 Difference]: With dead ends: 760 [2024-11-07 10:47:02,258 INFO L226 Difference]: Without dead ends: 564 [2024-11-07 10:47:02,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:47:02,260 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 134 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:02,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1440 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:47:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-07 10:47:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2024-11-07 10:47:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3861671469740633) internal successors, (481), 349 states have internal predecessors, (481), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:47:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 553 transitions. [2024-11-07 10:47:02,289 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 553 transitions. Word has length 109 [2024-11-07 10:47:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:02,290 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 553 transitions. [2024-11-07 10:47:02,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 553 transitions. [2024-11-07 10:47:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:47:02,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:02,292 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:47:02,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 101280422, now seen corresponding path program 1 times [2024-11-07 10:47:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155860225] [2024-11-07 10:47:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:47:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:47:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:47:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:47:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:47:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:47:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:47:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:03,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155860225] [2024-11-07 10:47:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155860225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:47:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195656876] [2024-11-07 10:47:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:47:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:47:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:47:03,050 INFO L87 Difference]: Start difference. First operand 388 states and 553 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:03,408 INFO L93 Difference]: Finished difference Result 697 states and 994 transitions. [2024-11-07 10:47:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:47:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:47:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:03,417 INFO L225 Difference]: With dead ends: 697 [2024-11-07 10:47:03,417 INFO L226 Difference]: Without dead ends: 473 [2024-11-07 10:47:03,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-11-07 10:47:03,420 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 152 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:03,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 555 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:47:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-07 10:47:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 388. [2024-11-07 10:47:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3804034582132565) internal successors, (479), 349 states have internal predecessors, (479), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:47:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 551 transitions. [2024-11-07 10:47:03,462 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 551 transitions. Word has length 109 [2024-11-07 10:47:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 551 transitions. [2024-11-07 10:47:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 551 transitions. [2024-11-07 10:47:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:47:03,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:03,466 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:03,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:47:03,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:03,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 978384166, now seen corresponding path program 1 times [2024-11-07 10:47:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:03,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742691724] [2024-11-07 10:47:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:47:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:47:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:47:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:47:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:47:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:47:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:47:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742691724] [2024-11-07 10:47:04,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742691724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:04,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:04,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:47:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690537533] [2024-11-07 10:47:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:04,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:47:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:47:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:47:04,194 INFO L87 Difference]: Start difference. First operand 388 states and 551 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:04,632 INFO L93 Difference]: Finished difference Result 699 states and 992 transitions. [2024-11-07 10:47:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:47:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:47:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:04,635 INFO L225 Difference]: With dead ends: 699 [2024-11-07 10:47:04,636 INFO L226 Difference]: Without dead ends: 475 [2024-11-07 10:47:04,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:47:04,639 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 79 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:04,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 630 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:47:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-07 10:47:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 388. [2024-11-07 10:47:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3746397694524495) internal successors, (477), 349 states have internal predecessors, (477), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:47:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 549 transitions. [2024-11-07 10:47:04,674 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 549 transitions. Word has length 109 [2024-11-07 10:47:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:04,674 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 549 transitions. [2024-11-07 10:47:04,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 549 transitions. [2024-11-07 10:47:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:47:04,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:04,676 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:47:04,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -32733084, now seen corresponding path program 1 times [2024-11-07 10:47:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300668346] [2024-11-07 10:47:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:47:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:47:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:47:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:47:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:47:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:47:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:47:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300668346] [2024-11-07 10:47:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300668346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:47:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752417444] [2024-11-07 10:47:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:47:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:05,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:47:05,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:47:05,025 INFO L87 Difference]: Start difference. First operand 388 states and 549 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:05,440 INFO L93 Difference]: Finished difference Result 782 states and 1107 transitions. [2024-11-07 10:47:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:47:05,440 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:47:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:05,444 INFO L225 Difference]: With dead ends: 782 [2024-11-07 10:47:05,444 INFO L226 Difference]: Without dead ends: 558 [2024-11-07 10:47:05,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:47:05,445 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 129 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:05,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1188 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:47:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-07 10:47:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2024-11-07 10:47:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.3753665689149561) internal successors, (469), 343 states have internal predecessors, (469), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:47:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2024-11-07 10:47:05,469 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 109 [2024-11-07 10:47:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:05,469 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2024-11-07 10:47:05,470 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2024-11-07 10:47:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:47:05,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:05,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:47:05,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:05,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926694, now seen corresponding path program 1 times [2024-11-07 10:47:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810529038] [2024-11-07 10:47:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:47:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:47:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:47:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:47:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:47:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:47:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:47:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810529038] [2024-11-07 10:47:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810529038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:47:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826993217] [2024-11-07 10:47:05,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:05,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:47:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:47:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:47:05,730 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:06,017 INFO L93 Difference]: Finished difference Result 440 states and 615 transitions. [2024-11-07 10:47:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:47:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-07 10:47:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:06,021 INFO L225 Difference]: With dead ends: 440 [2024-11-07 10:47:06,021 INFO L226 Difference]: Without dead ends: 438 [2024-11-07 10:47:06,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:47:06,023 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 113 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:06,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 565 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:47:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-07 10:47:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2024-11-07 10:47:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 383 states have (on average 1.349869451697128) internal successors, (517), 386 states have internal predecessors, (517), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 10:47:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 609 transitions. [2024-11-07 10:47:06,052 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 609 transitions. Word has length 110 [2024-11-07 10:47:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:06,053 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 609 transitions. [2024-11-07 10:47:06,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 609 transitions. [2024-11-07 10:47:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:47:06,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:06,054 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:47:06,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773736, now seen corresponding path program 1 times [2024-11-07 10:47:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:06,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018186792] [2024-11-07 10:47:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:47:06,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:47:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:47:06,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:47:06,261 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:47:06,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:47:06,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:47:06,266 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:06,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:47:06,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:47:06 BoogieIcfgContainer [2024-11-07 10:47:06,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:47:06,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:47:06,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:47:06,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:47:06,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:46:52" (3/4) ... [2024-11-07 10:47:06,331 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:47:06,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:47:06,334 INFO L158 Benchmark]: Toolchain (without parser) took 14724.81ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 116.6MB in the beginning and 320.9MB in the end (delta: -204.3MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-11-07 10:47:06,334 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:06,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.63ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 101.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:47:06,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.39ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 97.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:06,335 INFO L158 Benchmark]: Boogie Preprocessor took 85.72ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:47:06,335 INFO L158 Benchmark]: RCFGBuilder took 837.57ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 64.0MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 10:47:06,336 INFO L158 Benchmark]: TraceAbstraction took 13425.96ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.3MB in the beginning and 321.1MB in the end (delta: -257.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:06,337 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 394.3MB. Free memory was 321.1MB in the beginning and 320.9MB in the end (delta: 155.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:47:06,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.63ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 101.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.39ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 97.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.72ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 837.57ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 64.0MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13425.96ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.3MB in the beginning and 321.1MB in the end (delta: -257.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 394.3MB. Free memory was 321.1MB in the beginning and 320.9MB in the end (delta: 155.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_12 [L55] EXPR WrapperStruct00.var_1_16 [L55] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L56] signed long int stepLocal_0 = -4; [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-4] [L57] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_15) [L60] EXPR WrapperStruct00.var_1_3 [L60] unsigned char stepLocal_2 = WrapperStruct00.var_1_3; [L61] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L61] COND FALSE !(WrapperStruct00.var_1_9) [L70] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L70] EXPR WrapperStruct00.var_1_1 [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] signed long int stepLocal_1 = (((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)); [L71] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16, stepLocal_2=7] [L71] COND FALSE !((8 * WrapperStruct00.var_1_1) == stepLocal_1) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_4 = WrapperStruct00.var_1_10 [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_12 [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 7393 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5481 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3875 IncrementalHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 1912 mSDtfsCounter, 3875 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 620 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1511 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 3432/3432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:47:06,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:47:08,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:47:08,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:47:08,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:47:08,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:47:08,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:47:08,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:47:08,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:47:08,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:47:08,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:47:08,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:47:08,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:47:08,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:47:08,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:47:08,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:47:08,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:47:08,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:47:08,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:47:08,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:47:08,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:47:08,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:47:08,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:47:08,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:47:08,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:47:08,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:47:08,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:47:08,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:08,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:47:08,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:47:08,797 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-07 10:47:09,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:47:09,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:47:09,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:47:09,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:47:09,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:47:09,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:47:10,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:47:10,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:47:10,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:47:10,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e63a89eb/26a66c34ad4f472687cbe5b3ddbdd2b4/FLAG2a694746f [2024-11-07 10:47:11,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e63a89eb/26a66c34ad4f472687cbe5b3ddbdd2b4 [2024-11-07 10:47:11,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:47:11,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:47:11,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:11,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:47:11,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:47:11,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f01534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11, skipping insertion in model container [2024-11-07 10:47:11,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:47:11,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-07 10:47:11,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:11,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:47:11,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-07 10:47:11,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:11,290 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:47:11,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11 WrapperNode [2024-11-07 10:47:11,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:11,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:11,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:47:11,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:47:11,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,359 INFO L138 Inliner]: procedures = 34, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-11-07 10:47:11,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:11,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:47:11,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:47:11,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:47:11,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,404 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-07 10:47:11,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:47:11,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:47:11,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:47:11,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:47:11,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (1/1) ... [2024-11-07 10:47:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:11,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:47:11,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:47:11,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:47:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:47:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:47:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:47:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:47:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:47:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:47:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:47:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:47:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:47:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:47:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:47:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:47:11,651 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:47:11,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:47:13,167 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-07 10:47:13,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:47:13,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:47:13,184 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:47:13,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:13 BoogieIcfgContainer [2024-11-07 10:47:13,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:47:13,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:47:13,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:47:13,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:47:13,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:47:11" (1/3) ... [2024-11-07 10:47:13,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7777549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:13, skipping insertion in model container [2024-11-07 10:47:13,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:11" (2/3) ... [2024-11-07 10:47:13,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7777549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:13, skipping insertion in model container [2024-11-07 10:47:13,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:13" (3/3) ... [2024-11-07 10:47:13,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-07 10:47:13,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:47:13,208 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:47:13,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:47:13,262 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;@3d3b8f37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:47:13,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:47:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:47:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:47:13,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:13,274 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:13,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:13,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2063923592, now seen corresponding path program 1 times [2024-11-07 10:47:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:13,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252463519] [2024-11-07 10:47:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:13,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:13,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:47:13,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:47:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:13,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:47:13,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-07 10:47:13,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:13,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252463519] [2024-11-07 10:47:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252463519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:47:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285899637] [2024-11-07 10:47:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:47:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:47:13,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:47:13,775 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:13,800 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-07 10:47:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:47:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-07 10:47:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:13,807 INFO L225 Difference]: With dead ends: 213 [2024-11-07 10:47:13,808 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:47:13,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:47:13,813 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:13,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:47:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 10:47:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:47:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-07 10:47:13,863 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-07 10:47:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-07 10:47:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:47:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-07 10:47:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:47:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:13,868 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:13,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:47:14,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:14,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:14,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1289475548, now seen corresponding path program 1 times [2024-11-07 10:47:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065944191] [2024-11-07 10:47:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:14,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:47:14,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:47:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:14,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:47:14,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:14,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:14,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:14,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065944191] [2024-11-07 10:47:14,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065944191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:14,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:47:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978881083] [2024-11-07 10:47:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:14,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:47:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:47:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:14,497 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:14,554 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-07 10:47:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:47:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-07 10:47:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:14,562 INFO L225 Difference]: With dead ends: 211 [2024-11-07 10:47:14,562 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 10:47:14,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:14,566 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:14,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 10:47:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 10:47:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:47:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-07 10:47:14,584 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-07 10:47:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-07 10:47:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-07 10:47:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:47:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:14,590 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:47:14,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:14,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:14,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1249640545, now seen corresponding path program 1 times [2024-11-07 10:47:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842195522] [2024-11-07 10:47:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:14,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:47:14,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:47:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:15,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:47:15,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:15,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:15,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:15,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842195522] [2024-11-07 10:47:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842195522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:15,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:15,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:47:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953127908] [2024-11-07 10:47:15,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:47:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:47:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:15,160 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:15,321 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-07 10:47:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:47:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:47:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:15,323 INFO L225 Difference]: With dead ends: 218 [2024-11-07 10:47:15,323 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:47:15,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:15,324 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:15,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:47:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:47:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 10:47:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:47:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-07 10:47:15,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-07 10:47:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:15,333 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-07 10:47:15,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-07 10:47:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:47:15,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:15,335 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:15,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:47:15,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:15,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 525366817, now seen corresponding path program 1 times [2024-11-07 10:47:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012642043] [2024-11-07 10:47:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:15,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:15,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:47:15,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:47:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:15,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:47:15,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:47:15,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:15,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012642043] [2024-11-07 10:47:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012642043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:15,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:15,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:47:15,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886596053] [2024-11-07 10:47:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:15,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:47:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:47:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:47:15,854 INFO L87 Difference]: Start difference. First operand 112 states and 161 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:16,021 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-11-07 10:47:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:47:16,021 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:47:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:16,023 INFO L225 Difference]: With dead ends: 224 [2024-11-07 10:47:16,023 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 10:47:16,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-11-07 10:47:16,024 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:16,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:47:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 10:47:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-07 10:47:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:47:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-07 10:47:16,034 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-07 10:47:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:16,035 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-07 10:47:16,035 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:47:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-07 10:47:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:47:16,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:16,036 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:16,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:47:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:16,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash 527213859, now seen corresponding path program 1 times [2024-11-07 10:47:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977212772] [2024-11-07 10:47:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:47:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:16,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:47:16,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:47:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:16,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:47:16,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:16,614 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 88 treesize of output 87 [2024-11-07 10:47:16,879 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 144 treesize of output 125 [2024-11-07 10:47:17,836 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 139 treesize of output 122 [2024-11-07 10:47:18,850 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 144 treesize of output 127 [2024-11-07 10:47:21,111 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 144 treesize of output 125 [2024-11-07 10:47:23,640 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 145 treesize of output 128 [2024-11-07 10:47:32,657 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 150 treesize of output 133 [2024-11-07 10:47:59,832 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 139 treesize of output 122