./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.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_fillercode_fillercodestructure_normal_file-63.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', '22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6'] 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_fillercode_fillercodestructure_normal_file-63.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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:28:43,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:28:43,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:28:43,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:28:43,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:28:43,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:28:43,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:28:43,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:28:43,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:28:43,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:28:43,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:28:43,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:28:43,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:28:43,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:28:43,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:28:43,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:28:43,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:28:43,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:28:43,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:28:43,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:28:43,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:28:43,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:28:43,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:43,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:28:43,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:28:43,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:28:43,928 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-07 07:28:44,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:28:44,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:28:44,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:28:44,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:28:44,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:28:44,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:28:45,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:28:45,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:28:45,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:28:45,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95ba5a513/9005143df947404f97173529bf77fc7b/FLAG2be3661f6 [2024-11-07 07:28:45,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95ba5a513/9005143df947404f97173529bf77fc7b [2024-11-07 07:28:45,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:28:45,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:28:45,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:45,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:28:45,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:28:45,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:45" (1/1) ... [2024-11-07 07:28:45,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2706b8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:45, skipping insertion in model container [2024-11-07 07:28:45,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:45" (1/1) ... [2024-11-07 07:28:45,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:28:46,065 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-11-07 07:28:46,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:46,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:28:46,152 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-11-07 07:28:46,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:46,194 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:28:46,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46 WrapperNode [2024-11-07 07:28:46,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:46,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:46,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:28:46,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:28:46,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,246 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-07 07:28:46,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:46,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:28:46,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:28:46,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:28:46,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,279 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:28:46,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:28:46,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:28:46,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:28:46,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:28:46,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (1/1) ... [2024-11-07 07:28:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:46,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:28:46,340 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 07:28:46,344 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 07:28:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:28:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:28:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:28:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:28:46,451 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:28:46,453 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:28:46,881 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 07:28:46,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:28:46,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:28:46,891 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:28:46,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:46 BoogieIcfgContainer [2024-11-07 07:28:46,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:28:46,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:28:46,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:28:46,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:28:46,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:28:45" (1/3) ... [2024-11-07 07:28:46,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604afa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:46, skipping insertion in model container [2024-11-07 07:28:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:46" (2/3) ... [2024-11-07 07:28:46,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604afa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:46, skipping insertion in model container [2024-11-07 07:28:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:46" (3/3) ... [2024-11-07 07:28:46,902 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:28:46,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:28:46,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:28:46,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:28:46,984 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;@6cba1af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:28:46,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:28:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:28:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:47,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:47,002 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:47,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -443072802, now seen corresponding path program 1 times [2024-11-07 07:28:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191874864] [2024-11-07 07:28:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191874864] [2024-11-07 07:28:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191874864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:28:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825242644] [2024-11-07 07:28:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:47,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:28:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:28:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:28:47,402 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:28:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:47,429 INFO L93 Difference]: Finished difference Result 137 states and 222 transitions. [2024-11-07 07:28:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:28:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-11-07 07:28:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:47,436 INFO L225 Difference]: With dead ends: 137 [2024-11-07 07:28:47,436 INFO L226 Difference]: Without dead ends: 68 [2024-11-07 07:28:47,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 07:28:47,441 INFO L432 NwaCegarLoop]: 99 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, 99 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 07:28:47,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:28:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-07 07:28:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-07 07:28:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:28:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-07 07:28:47,483 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116 [2024-11-07 07:28:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-07 07:28:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:28:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-07 07:28:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:47,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:47,487 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:28:47,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 811653010, now seen corresponding path program 1 times [2024-11-07 07:28:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071364898] [2024-11-07 07:28:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071364898] [2024-11-07 07:28:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071364898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:28:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075950615] [2024-11-07 07:28:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:47,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:28:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:28:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:28:47,829 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:47,893 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2024-11-07 07:28:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:28:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 07:28:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:47,898 INFO L225 Difference]: With dead ends: 163 [2024-11-07 07:28:47,898 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 07:28:47,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:28:47,903 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:47,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:28:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 07:28:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-11-07 07:28:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:28:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-07 07:28:47,923 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116 [2024-11-07 07:28:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:47,926 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-07 07:28:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-07 07:28:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:47,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:47,930 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:28:47,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1524127698, now seen corresponding path program 1 times [2024-11-07 07:28:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995717776] [2024-11-07 07:28:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995717776] [2024-11-07 07:28:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995717776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:48,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:48,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:28:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053265811] [2024-11-07 07:28:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:28:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:48,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:28:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:28:48,387 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:48,621 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2024-11-07 07:28:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:28:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 07:28:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:48,624 INFO L225 Difference]: With dead ends: 230 [2024-11-07 07:28:48,624 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 07:28:48,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:28:48,628 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:48,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:28:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 07:28:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101. [2024-11-07 07:28:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:28:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-11-07 07:28:48,654 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 116 [2024-11-07 07:28:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:48,655 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-11-07 07:28:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-11-07 07:28:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:48,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:48,659 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:28:48,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:48,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2110933712, now seen corresponding path program 1 times [2024-11-07 07:28:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:48,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653332157] [2024-11-07 07:28:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653332157] [2024-11-07 07:28:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653332157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180054673] [2024-11-07 07:28:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:49,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:49,122 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:49,876 INFO L93 Difference]: Finished difference Result 537 states and 781 transitions. [2024-11-07 07:28:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:28:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 07:28:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:49,884 INFO L225 Difference]: With dead ends: 537 [2024-11-07 07:28:49,885 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 07:28:49,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:28:49,889 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 344 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:49,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 958 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:28:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 07:28:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 235. [2024-11-07 07:28:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.41) internal successors, (282), 200 states have internal predecessors, (282), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 07:28:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2024-11-07 07:28:49,929 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 116 [2024-11-07 07:28:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:49,930 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2024-11-07 07:28:49,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2024-11-07 07:28:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:49,932 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:49,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:28:49,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:49,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1099816462, now seen corresponding path program 1 times [2024-11-07 07:28:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287674910] [2024-11-07 07:28:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287674910] [2024-11-07 07:28:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287674910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:50,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:28:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602756975] [2024-11-07 07:28:50,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:50,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:28:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:28:50,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:28:50,245 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:50,357 INFO L93 Difference]: Finished difference Result 678 states and 1002 transitions. [2024-11-07 07:28:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:28:50,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 07:28:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:50,360 INFO L225 Difference]: With dead ends: 678 [2024-11-07 07:28:50,360 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 07:28:50,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:28:50,364 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:50,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 410 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:28:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 07:28:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 442. [2024-11-07 07:28:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 373 states have (on average 1.4048257372654156) internal successors, (524), 373 states have internal predecessors, (524), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 652 transitions. [2024-11-07 07:28:50,423 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 652 transitions. Word has length 116 [2024-11-07 07:28:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:50,424 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 652 transitions. [2024-11-07 07:28:50,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 652 transitions. [2024-11-07 07:28:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:28:50,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:50,426 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:28:50,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1917464912, now seen corresponding path program 1 times [2024-11-07 07:28:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061038029] [2024-11-07 07:28:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061038029] [2024-11-07 07:28:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061038029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:50,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:28:50,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926161562] [2024-11-07 07:28:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:50,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:28:50,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:28:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:28:50,812 INFO L87 Difference]: Start difference. First operand 442 states and 652 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:51,239 INFO L93 Difference]: Finished difference Result 1111 states and 1630 transitions. [2024-11-07 07:28:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:28:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-07 07:28:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:51,246 INFO L225 Difference]: With dead ends: 1111 [2024-11-07 07:28:51,248 INFO L226 Difference]: Without dead ends: 672 [2024-11-07 07:28:51,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:28:51,250 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 197 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:51,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 329 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:28:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-07 07:28:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 456. [2024-11-07 07:28:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 387 states have (on average 1.3772609819121446) internal successors, (533), 387 states have internal predecessors, (533), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 661 transitions. [2024-11-07 07:28:51,336 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 661 transitions. Word has length 116 [2024-11-07 07:28:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:51,336 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 661 transitions. [2024-11-07 07:28:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 661 transitions. [2024-11-07 07:28:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 07:28:51,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:51,338 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:28:51,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2007101273, now seen corresponding path program 1 times [2024-11-07 07:28:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:51,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481190816] [2024-11-07 07:28:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481190816] [2024-11-07 07:28:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481190816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:51,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:28:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759655287] [2024-11-07 07:28:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:51,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:28:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:28:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:28:51,611 INFO L87 Difference]: Start difference. First operand 456 states and 661 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:51,937 INFO L93 Difference]: Finished difference Result 1186 states and 1717 transitions. [2024-11-07 07:28:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:28:51,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-07 07:28:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:51,942 INFO L225 Difference]: With dead ends: 1186 [2024-11-07 07:28:51,943 INFO L226 Difference]: Without dead ends: 733 [2024-11-07 07:28:51,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 07:28:51,945 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 211 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:51,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 104 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:28:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-07 07:28:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 460. [2024-11-07 07:28:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 391 states have internal predecessors, (537), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 665 transitions. [2024-11-07 07:28:52,048 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 665 transitions. Word has length 117 [2024-11-07 07:28:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:52,049 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 665 transitions. [2024-11-07 07:28:52,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2024-11-07 07:28:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 07:28:52,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:52,050 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:52,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:28:52,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1420295259, now seen corresponding path program 1 times [2024-11-07 07:28:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823875995] [2024-11-07 07:28:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823875995] [2024-11-07 07:28:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823875995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:52,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:28:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053633817] [2024-11-07 07:28:52,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:52,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:28:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:28:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:28:52,760 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:54,143 INFO L93 Difference]: Finished difference Result 1229 states and 1768 transitions. [2024-11-07 07:28:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:28:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-07 07:28:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:54,149 INFO L225 Difference]: With dead ends: 1229 [2024-11-07 07:28:54,149 INFO L226 Difference]: Without dead ends: 771 [2024-11-07 07:28:54,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 07:28:54,151 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 246 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:54,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1423 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:28:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-07 07:28:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 502. [2024-11-07 07:28:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 433 states have (on average 1.3764434180138567) internal successors, (596), 433 states have internal predecessors, (596), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2024-11-07 07:28:54,220 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 117 [2024-11-07 07:28:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:54,220 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2024-11-07 07:28:54,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2024-11-07 07:28:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 07:28:54,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:54,223 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:54,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:28:54,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:54,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1842997085, now seen corresponding path program 1 times [2024-11-07 07:28:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:54,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679615441] [2024-11-07 07:28:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:54,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:54,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679615441] [2024-11-07 07:28:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679615441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327007601] [2024-11-07 07:28:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:54,525 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:54,921 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2024-11-07 07:28:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:28:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-07 07:28:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:54,926 INFO L225 Difference]: With dead ends: 1225 [2024-11-07 07:28:54,926 INFO L226 Difference]: Without dead ends: 726 [2024-11-07 07:28:54,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:28:54,928 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:54,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 570 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:28:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-07 07:28:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 532. [2024-11-07 07:28:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 463 states have (on average 1.3736501079913608) internal successors, (636), 463 states have internal predecessors, (636), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2024-11-07 07:28:55,005 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 764 transitions. Word has length 117 [2024-11-07 07:28:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:55,006 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 764 transitions. [2024-11-07 07:28:55,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 764 transitions. [2024-11-07 07:28:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:28:55,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:55,008 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:55,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:28:55,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 674571830, now seen corresponding path program 1 times [2024-11-07 07:28:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393299466] [2024-11-07 07:28:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393299466] [2024-11-07 07:28:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393299466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:55,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:55,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:28:55,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304538328] [2024-11-07 07:28:55,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:55,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:28:55,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:28:55,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:28:55,451 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:56,236 INFO L93 Difference]: Finished difference Result 1255 states and 1792 transitions. [2024-11-07 07:28:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:28:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 07:28:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:56,242 INFO L225 Difference]: With dead ends: 1255 [2024-11-07 07:28:56,243 INFO L226 Difference]: Without dead ends: 726 [2024-11-07 07:28:56,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:28:56,245 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 178 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:56,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 822 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:28:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-07 07:28:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 574. [2024-11-07 07:28:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 505 states have (on average 1.3702970297029704) internal successors, (692), 505 states have internal predecessors, (692), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2024-11-07 07:28:56,322 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 118 [2024-11-07 07:28:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:56,322 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2024-11-07 07:28:56,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2024-11-07 07:28:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:28:56,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:56,324 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:56,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:28:56,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:56,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 155630701, now seen corresponding path program 1 times [2024-11-07 07:28:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:56,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569267302] [2024-11-07 07:28:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569267302] [2024-11-07 07:28:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569267302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:28:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240719492] [2024-11-07 07:28:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:28:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:28:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:28:56,871 INFO L87 Difference]: Start difference. First operand 574 states and 820 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:57,315 INFO L93 Difference]: Finished difference Result 1435 states and 2000 transitions. [2024-11-07 07:28:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:28:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 07:28:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:57,322 INFO L225 Difference]: With dead ends: 1435 [2024-11-07 07:28:57,322 INFO L226 Difference]: Without dead ends: 864 [2024-11-07 07:28:57,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:28:57,326 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 94 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:57,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 720 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:28:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-07 07:28:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 592. [2024-11-07 07:28:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 523 states have (on average 1.2848948374760993) internal successors, (672), 523 states have internal predecessors, (672), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 800 transitions. [2024-11-07 07:28:57,399 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 800 transitions. Word has length 118 [2024-11-07 07:28:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:57,400 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 800 transitions. [2024-11-07 07:28:57,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 800 transitions. [2024-11-07 07:28:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:28:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:57,404 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:28:57,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 455717112, now seen corresponding path program 1 times [2024-11-07 07:28:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371387068] [2024-11-07 07:28:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:57,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371387068] [2024-11-07 07:28:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371387068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062023759] [2024-11-07 07:28:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:57,680 INFO L87 Difference]: Start difference. First operand 592 states and 800 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:58,050 INFO L93 Difference]: Finished difference Result 1088 states and 1477 transitions. [2024-11-07 07:28:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:28:58,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-07 07:28:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:58,056 INFO L225 Difference]: With dead ends: 1088 [2024-11-07 07:28:58,056 INFO L226 Difference]: Without dead ends: 809 [2024-11-07 07:28:58,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:28:58,058 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 66 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:58,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 561 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:28:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-07 07:28:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 628. [2024-11-07 07:28:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 559 states have (on average 1.2737030411449015) internal successors, (712), 559 states have internal predecessors, (712), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 840 transitions. [2024-11-07 07:28:58,138 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 840 transitions. Word has length 118 [2024-11-07 07:28:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:58,139 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 840 transitions. [2024-11-07 07:28:58,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 840 transitions. [2024-11-07 07:28:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:28:58,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:58,141 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:58,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:28:58,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:58,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2131865737, now seen corresponding path program 1 times [2024-11-07 07:28:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:58,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463298257] [2024-11-07 07:28:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463298257] [2024-11-07 07:28:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463298257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:58,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658174449] [2024-11-07 07:28:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:58,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:58,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:58,322 INFO L87 Difference]: Start difference. First operand 628 states and 840 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:58,907 INFO L93 Difference]: Finished difference Result 1662 states and 2225 transitions. [2024-11-07 07:28:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:28:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:28:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:58,915 INFO L225 Difference]: With dead ends: 1662 [2024-11-07 07:28:58,916 INFO L226 Difference]: Without dead ends: 1037 [2024-11-07 07:28:58,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:28:58,918 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 294 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:58,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 269 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:28:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-07 07:28:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 686. [2024-11-07 07:28:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 617 states have (on average 1.2625607779578607) internal successors, (779), 617 states have internal predecessors, (779), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 907 transitions. [2024-11-07 07:28:59,005 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 907 transitions. Word has length 119 [2024-11-07 07:28:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:59,006 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 907 transitions. [2024-11-07 07:28:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 907 transitions. [2024-11-07 07:28:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:28:59,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:59,009 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 07:28:59,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1483043189, now seen corresponding path program 1 times [2024-11-07 07:28:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647259679] [2024-11-07 07:28:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:28:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:28:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:28:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:28:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:28:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:28:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:28:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:28:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:28:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:28:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:28:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:28:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:59,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647259679] [2024-11-07 07:28:59,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647259679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:59,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:59,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402843515] [2024-11-07 07:28:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:59,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:59,420 INFO L87 Difference]: Start difference. First operand 686 states and 907 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:59,898 INFO L93 Difference]: Finished difference Result 1338 states and 1786 transitions. [2024-11-07 07:28:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:28:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:28:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:59,902 INFO L225 Difference]: With dead ends: 1338 [2024-11-07 07:28:59,903 INFO L226 Difference]: Without dead ends: 653 [2024-11-07 07:28:59,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:28:59,905 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 126 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:59,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 377 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:28:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-07 07:28:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 609. [2024-11-07 07:28:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.2555555555555555) internal successors, (678), 540 states have internal predecessors, (678), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:28:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 806 transitions. [2024-11-07 07:28:59,982 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 806 transitions. Word has length 119 [2024-11-07 07:28:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 806 transitions. [2024-11-07 07:28:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:28:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 806 transitions. [2024-11-07 07:28:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:28:59,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:59,985 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 07:28:59,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 347401600, now seen corresponding path program 1 times [2024-11-07 07:28:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657413990] [2024-11-07 07:28:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:29:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:29:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:29:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:29:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:29:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:29:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:29:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:29:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:29:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:29:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:29:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:29:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:29:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:29:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:29:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:29:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:29:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657413990] [2024-11-07 07:29:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657413990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:29:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242377078] [2024-11-07 07:29:00,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:00,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:29:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:29:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:29:00,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:00,080 INFO L87 Difference]: Start difference. First operand 609 states and 806 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:00,213 INFO L93 Difference]: Finished difference Result 1352 states and 1799 transitions. [2024-11-07 07:29:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:29:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:29:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:00,220 INFO L225 Difference]: With dead ends: 1352 [2024-11-07 07:29:00,220 INFO L226 Difference]: Without dead ends: 746 [2024-11-07 07:29:00,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:00,223 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:00,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 181 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:29:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-07 07:29:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 609. [2024-11-07 07:29:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 540 states have (on average 1.2481481481481482) internal successors, (674), 540 states have internal predecessors, (674), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:29:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 802 transitions. [2024-11-07 07:29:00,320 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 802 transitions. Word has length 119 [2024-11-07 07:29:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:00,321 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 802 transitions. [2024-11-07 07:29:00,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 802 transitions. [2024-11-07 07:29:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:29:00,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:00,324 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:00,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 07:29:00,324 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:00,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash 322395145, now seen corresponding path program 1 times [2024-11-07 07:29:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:29:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751764945] [2024-11-07 07:29:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:29:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:29:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:29:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:29:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:29:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:29:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:29:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:29:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:29:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:29:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:29:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:29:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:29:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:29:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:29:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:29:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:29:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751764945] [2024-11-07 07:29:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751764945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:29:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563011363] [2024-11-07 07:29:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:29:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:29:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:29:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:29:00,764 INFO L87 Difference]: Start difference. First operand 609 states and 802 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:01,179 INFO L93 Difference]: Finished difference Result 1197 states and 1543 transitions. [2024-11-07 07:29:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:29:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:29:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:01,184 INFO L225 Difference]: With dead ends: 1197 [2024-11-07 07:29:01,185 INFO L226 Difference]: Without dead ends: 851 [2024-11-07 07:29:01,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:29:01,187 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:01,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 715 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:29:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-07 07:29:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 619. [2024-11-07 07:29:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 550 states have (on average 1.2454545454545454) internal successors, (685), 550 states have internal predecessors, (685), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:29:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 813 transitions. [2024-11-07 07:29:01,267 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 813 transitions. Word has length 119 [2024-11-07 07:29:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:01,268 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 813 transitions. [2024-11-07 07:29:01,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 813 transitions. [2024-11-07 07:29:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:29:01,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:01,270 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:01,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 07:29:01,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2000934546, now seen corresponding path program 1 times [2024-11-07 07:29:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:29:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456776171] [2024-11-07 07:29:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:29:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:29:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:29:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:29:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:29:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:29:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:29:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:29:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:29:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:29:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:29:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:29:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:29:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:29:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:29:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:29:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:29:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456776171] [2024-11-07 07:29:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456776171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:29:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814937437] [2024-11-07 07:29:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:29:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:29:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:29:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:29:01,720 INFO L87 Difference]: Start difference. First operand 619 states and 813 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:02,042 INFO L93 Difference]: Finished difference Result 1148 states and 1484 transitions. [2024-11-07 07:29:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:29:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:29:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:02,050 INFO L225 Difference]: With dead ends: 1148 [2024-11-07 07:29:02,051 INFO L226 Difference]: Without dead ends: 792 [2024-11-07 07:29:02,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:29:02,053 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 53 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:02,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 621 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:29:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-07 07:29:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 611. [2024-11-07 07:29:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 542 states have (on average 1.2490774907749078) internal successors, (677), 542 states have internal predecessors, (677), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:29:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 805 transitions. [2024-11-07 07:29:02,149 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 805 transitions. Word has length 119 [2024-11-07 07:29:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 805 transitions. [2024-11-07 07:29:02,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 805 transitions. [2024-11-07 07:29:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:29:02,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:02,152 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:02,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 07:29:02,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1009036655, now seen corresponding path program 1 times [2024-11-07 07:29:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:29:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806941596] [2024-11-07 07:29:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:29:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:29:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:29:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:29:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:29:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:29:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:29:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:29:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:29:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:29:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:29:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:29:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:29:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:29:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:29:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:29:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:29:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806941596] [2024-11-07 07:29:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806941596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:02,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:29:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48463213] [2024-11-07 07:29:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:02,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:29:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:29:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:29:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:02,257 INFO L87 Difference]: Start difference. First operand 611 states and 805 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:02,408 INFO L93 Difference]: Finished difference Result 1397 states and 1856 transitions. [2024-11-07 07:29:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:29:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:29:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:02,414 INFO L225 Difference]: With dead ends: 1397 [2024-11-07 07:29:02,415 INFO L226 Difference]: Without dead ends: 789 [2024-11-07 07:29:02,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:02,417 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:02,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:29:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-07 07:29:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 577. [2024-11-07 07:29:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 508 states have (on average 1.2460629921259843) internal successors, (633), 508 states have internal predecessors, (633), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:29:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 761 transitions. [2024-11-07 07:29:02,506 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 761 transitions. Word has length 119 [2024-11-07 07:29:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 761 transitions. [2024-11-07 07:29:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 761 transitions. [2024-11-07 07:29:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 07:29:02,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:02,509 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:02,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 07:29:02,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:02,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -707217664, now seen corresponding path program 1 times [2024-11-07 07:29:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:29:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778917893] [2024-11-07 07:29:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:29:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:29:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:29:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:29:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:29:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:29:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:29:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:29:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:29:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:29:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:29:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:29:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:29:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:29:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:29:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:29:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:29:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778917893] [2024-11-07 07:29:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778917893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:02,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:29:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623424539] [2024-11-07 07:29:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:29:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:29:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:29:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:02,618 INFO L87 Difference]: Start difference. First operand 577 states and 761 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:02,767 INFO L93 Difference]: Finished difference Result 1329 states and 1764 transitions. [2024-11-07 07:29:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:29:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-07 07:29:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:02,774 INFO L225 Difference]: With dead ends: 1329 [2024-11-07 07:29:02,774 INFO L226 Difference]: Without dead ends: 755 [2024-11-07 07:29:02,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:02,776 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:02,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:29:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-07 07:29:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 577. [2024-11-07 07:29:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 508 states have (on average 1.234251968503937) internal successors, (627), 508 states have internal predecessors, (627), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 07:29:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 755 transitions. [2024-11-07 07:29:02,849 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 755 transitions. Word has length 119 [2024-11-07 07:29:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:02,849 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 755 transitions. [2024-11-07 07:29:02,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 755 transitions. [2024-11-07 07:29:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 07:29:02,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:02,852 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:02,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 07:29:02,852 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:02,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash -824987695, now seen corresponding path program 1 times [2024-11-07 07:29:02,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:29:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805369350] [2024-11-07 07:29:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:02,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:29:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:29:02,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:29:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:29:02,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:29:02,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:29:02,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:29:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 07:29:02,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:29:03,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:29:03,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:29:03 BoogieIcfgContainer [2024-11-07 07:29:03,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:29:03,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:29:03,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:29:03,094 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:29:03,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:46" (3/4) ... [2024-11-07 07:29:03,096 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:29:03,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:29:03,097 INFO L158 Benchmark]: Toolchain (without parser) took 17200.84ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 76.5MB in the beginning and 307.9MB in the end (delta: -231.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.74ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.18ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: Boogie Preprocessor took 53.37ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 53.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: RCFGBuilder took 590.27ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 70.1MB in the end (delta: -16.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-07 07:29:03,098 INFO L158 Benchmark]: TraceAbstraction took 16199.19ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 69.2MB in the beginning and 308.0MB in the end (delta: -238.8MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. [2024-11-07 07:29:03,099 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 343.9MB. Free memory was 308.0MB in the beginning and 307.9MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:29:03,101 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.94ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.74ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.18ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.37ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 53.9MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 590.27ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 70.1MB in the end (delta: -16.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16199.19ms. Allocated memory was 100.7MB in the beginning and 343.9MB in the end (delta: 243.3MB). Free memory was 69.2MB in the beginning and 308.0MB in the end (delta: -238.8MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 343.9MB. Free memory was 308.0MB in the beginning and 307.9MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2512 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2512 mSDsluCounter, 8941 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6284 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3463 IncrementalHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 2657 mSDtfsCounter, 3463 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=13, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 3168 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2354 NumberOfCodeBlocks, 2354 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2215 ConstructedInterpolants, 0 QuantifiedInterpolants, 5447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 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 07:29:03,132 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_fillercode_fillercodestructure_normal_file-63.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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:29:05,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:29:05,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:29:05,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:29:05,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:29:05,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:29:05,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:29:05,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:29:05,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:29:05,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:29:05,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:29:05,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:29:05,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:29:05,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:29:05,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:29:05,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:29:05,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:29:05,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:29:05,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:29:05,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:29:05,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:29:05,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:29:05,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:29:05,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:29:05,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:29:05,739 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-07 07:29:06,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:29:06,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:29:06,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:29:06,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:29:06,079 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:29:06,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:29:07,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:29:07,623 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:29:07,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:29:07,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b9aacdc/e2ca8f152aa54de8beed5d6dc866eea8/FLAG7b6d5ca3d [2024-11-07 07:29:07,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b9aacdc/e2ca8f152aa54de8beed5d6dc866eea8 [2024-11-07 07:29:07,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:29:07,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:29:07,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:29:07,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:29:07,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:29:07,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:29:07" (1/1) ... [2024-11-07 07:29:07,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66dc45e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:07, skipping insertion in model container [2024-11-07 07:29:07,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:29:07" (1/1) ... [2024-11-07 07:29:07,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:29:07,834 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-11-07 07:29:07,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:29:07,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:29:07,943 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-11-07 07:29:07,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:29:08,004 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:29:08,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08 WrapperNode [2024-11-07 07:29:08,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:29:08,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:29:08,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:29:08,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:29:08,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,068 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-07 07:29:08,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:29:08,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:29:08,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:29:08,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:29:08,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:29:08,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:29:08,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:29:08,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:29:08,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:29:08,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (1/1) ... [2024-11-07 07:29:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:29:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:29:08,178 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 07:29:08,181 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 07:29:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:29:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:29:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:29:08,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:29:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:29:08,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:29:08,298 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:29:08,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:29:14,667 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:29:14,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:29:14,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:29:14,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:29:14,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:29:14 BoogieIcfgContainer [2024-11-07 07:29:14,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:29:14,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:29:14,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:29:14,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:29:14,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:29:07" (1/3) ... [2024-11-07 07:29:14,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323e031a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:29:14, skipping insertion in model container [2024-11-07 07:29:14,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:29:08" (2/3) ... [2024-11-07 07:29:14,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323e031a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:29:14, skipping insertion in model container [2024-11-07 07:29:14,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:29:14" (3/3) ... [2024-11-07 07:29:14,687 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2024-11-07 07:29:14,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:29:14,717 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:29:14,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:29:14,781 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;@3674a4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:29:14,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:29:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:29:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 07:29:14,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:14,795 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:14,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:14,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash 784188602, now seen corresponding path program 1 times [2024-11-07 07:29:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:29:14,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856800089] [2024-11-07 07:29:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:14,808 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 07:29:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:29:14,811 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 07:29:14,812 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 07:29:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:15,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:29:15,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:29:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-07 07:29:15,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:29:15,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:29:15,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856800089] [2024-11-07 07:29:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856800089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:29:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573200451] [2024-11-07 07:29:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:29:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:29:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:29:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:29:15,241 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:29:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:15,262 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2024-11-07 07:29:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:29:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-07 07:29:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:15,269 INFO L225 Difference]: With dead ends: 109 [2024-11-07 07:29:15,269 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 07:29:15,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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 07:29:15,274 INFO L432 NwaCegarLoop]: 78 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, 78 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 07:29:15,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:29:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 07:29:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 07:29:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:29:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-07 07:29:15,312 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2024-11-07 07:29:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:15,313 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-07 07:29:15,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 07:29:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-07 07:29:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 07:29:15,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:15,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:15,331 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 07:29:15,521 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 07:29:15,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:15,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1409610862, now seen corresponding path program 1 times [2024-11-07 07:29:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:29:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510907664] [2024-11-07 07:29:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:15,524 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 07:29:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:29:15,528 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 07:29:15,530 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 07:29:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:15,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:29:15,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:29:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 07:29:16,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:29:16,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:29:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510907664] [2024-11-07 07:29:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510907664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:29:16,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:29:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:29:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938775995] [2024-11-07 07:29:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:29:16,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:29:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:29:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:29:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:16,087 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:20,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:22,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:22,324 INFO L93 Difference]: Finished difference Result 121 states and 175 transitions. [2024-11-07 07:29:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:29:22,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-07 07:29:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:22,326 INFO L225 Difference]: With dead ends: 121 [2024-11-07 07:29:22,326 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 07:29:22,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:29:22,329 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:22,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-11-07 07:29:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 07:29:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-11-07 07:29:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 07:29:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-07 07:29:22,341 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 110 [2024-11-07 07:29:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-07 07:29:22,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 07:29:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-07 07:29:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 07:29:22,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:22,345 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:22,359 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 (3)] Ended with exit code 0 [2024-11-07 07:29:22,545 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 07:29:22,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1926126418, now seen corresponding path program 1 times [2024-11-07 07:29:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:29:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10459222] [2024-11-07 07:29:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:22,547 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 07:29:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:29:22,549 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 07:29:22,551 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 07:29:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:23,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 07:29:23,029 INFO L278 TraceCheckSpWp]: Computing forward predicates...