./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-12.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_floatingpointinfluence_has-floats_file-12.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', '6517810fcc8d90263122de976dfce4e9ef873c435b74535186b5b764d9754163'] 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_floatingpointinfluence_has-floats_file-12.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 6517810fcc8d90263122de976dfce4e9ef873c435b74535186b5b764d9754163 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:33:43,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:33:43,248 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:33:43,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:33:43,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:33:43,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:33:43,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:33:43,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:33:43,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:33:43,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:33:43,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:33:43,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:33:43,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:33:43,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:33:43,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:33:43,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:33:43,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:43,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:33:43,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:33:43,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:33:43,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:33:43,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:33:43,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:33:43,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:33:43,277 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 -> 6517810fcc8d90263122de976dfce4e9ef873c435b74535186b5b764d9754163 [2024-11-07 07:33:43,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:33:43,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:33:43,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:33:43,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:33:43,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:33:43,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-12.i [2024-11-07 07:33:44,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:33:44,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:33:44,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-12.i [2024-11-07 07:33:44,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5eb53abef/78d2b8b6ad3e49798b277d63d4c9d56e/FLAGe956b42aa [2024-11-07 07:33:45,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5eb53abef/78d2b8b6ad3e49798b277d63d4c9d56e [2024-11-07 07:33:45,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:33:45,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:33:45,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:45,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:33:45,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:33:45,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e093049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45, skipping insertion in model container [2024-11-07 07:33:45,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:33:45,263 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_floatingpointinfluence_has-floats_file-12.i[917,930] [2024-11-07 07:33:45,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:45,295 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:33:45,302 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_floatingpointinfluence_has-floats_file-12.i[917,930] [2024-11-07 07:33:45,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:45,328 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:33:45,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45 WrapperNode [2024-11-07 07:33:45,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:45,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:45,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:33:45,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:33:45,333 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:33:45" (1/1) ... [2024-11-07 07:33:45,338 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:33:45" (1/1) ... [2024-11-07 07:33:45,368 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-07 07:33:45,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:45,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:33:45,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:33:45,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:33:45,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,396 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:33:45,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:33:45,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:33:45,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:33:45,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:33:45,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (1/1) ... [2024-11-07 07:33:45,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:33:45,444 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:33:45,449 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:33:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:33:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:33:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:33:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:33:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:33:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:33:45,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:33:45,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:33:45,691 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 07:33:45,691 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:33:45,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:33:45,697 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:33:45,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:45 BoogieIcfgContainer [2024-11-07 07:33:45,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:33:45,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:33:45,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:33:45,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:33:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:45" (1/3) ... [2024-11-07 07:33:45,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f14992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:45, skipping insertion in model container [2024-11-07 07:33:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:45" (2/3) ... [2024-11-07 07:33:45,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f14992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:45, skipping insertion in model container [2024-11-07 07:33:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:45" (3/3) ... [2024-11-07 07:33:45,703 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-12.i [2024-11-07 07:33:45,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:33:45,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:33:45,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:33:45,757 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;@558ae4f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:33:45,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:33:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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:33:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:33:45,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:45,766 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] [2024-11-07 07:33:45,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:45,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1058777531, now seen corresponding path program 1 times [2024-11-07 07:33:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:45,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568600743] [2024-11-07 07:33:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:33:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:33:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:33:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:33:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:33:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:33:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:33:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:33:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:33:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:33:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:46,059 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:33:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568600743] [2024-11-07 07:33:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568600743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:33:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924413868] [2024-11-07 07:33:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:46,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:33:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:33:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:46,084 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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:33:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:46,098 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2024-11-07 07:33:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:33:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 102 [2024-11-07 07:33:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:46,104 INFO L225 Difference]: With dead ends: 93 [2024-11-07 07:33:46,104 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 07:33:46,107 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:33:46,109 INFO L432 NwaCegarLoop]: 63 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, 63 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:33:46,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:33:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 07:33:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 07:33:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:33:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-07 07:33:46,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 102 [2024-11-07 07:33:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:46,138 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-07 07:33:46,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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:33:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-07 07:33:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:33:46,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:46,142 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] [2024-11-07 07:33:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:33:46,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -13465157, now seen corresponding path program 1 times [2024-11-07 07:33:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037961749] [2024-11-07 07:33:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:33:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:33:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:33:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:33:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:33:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:33:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:33:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:33:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:33:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:33:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:48,187 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:33:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037961749] [2024-11-07 07:33:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037961749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:33:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239389239] [2024-11-07 07:33:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:33:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:33:48,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:33:48,190 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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:33:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:49,493 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2024-11-07 07:33:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:33:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 102 [2024-11-07 07:33:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:49,496 INFO L225 Difference]: With dead ends: 100 [2024-11-07 07:33:49,496 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 07:33:49,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:33:49,497 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 75 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:49,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 412 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 07:33:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 07:33:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2024-11-07 07:33:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 states have internal predecessors, (56), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:33:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-07 07:33:49,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 102 [2024-11-07 07:33:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-07 07:33:49,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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:33:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-07 07:33:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:33:49,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:49,520 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] [2024-11-07 07:33:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:33:49,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash 666593213, now seen corresponding path program 1 times [2024-11-07 07:33:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13684003] [2024-11-07 07:33:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:33:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:33:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:33:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:33:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:33:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:33:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:33:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:33:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:33:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:33:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:56,506 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:33:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13684003] [2024-11-07 07:33:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13684003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:56,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:33:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517178722] [2024-11-07 07:33:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:56,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:33:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:33:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:33:56,508 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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:33:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:59,512 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-11-07 07:33:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:33:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 102 [2024-11-07 07:33:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:59,515 INFO L225 Difference]: With dead ends: 91 [2024-11-07 07:33:59,515 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 07:33:59,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:33:59,517 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:59,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 301 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:33:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 07:33:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-07 07:33:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:33:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2024-11-07 07:33:59,528 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 102 [2024-11-07 07:33:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:59,529 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2024-11-07 07:33:59,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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:33:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-11-07 07:33:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:33:59,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:59,530 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] [2024-11-07 07:33:59,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:33:59,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 413803116, now seen corresponding path program 1 times [2024-11-07 07:33:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355990106] [2024-11-07 07:33:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:34:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:34:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:34:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:34:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:34:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:34:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:34:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:34:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:34:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:34:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:34:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:34:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:34:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:34:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:34:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:34:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,538 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:34:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:34:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355990106] [2024-11-07 07:34:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355990106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:34:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:34:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:34:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004269621] [2024-11-07 07:34:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:34:00,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:34:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:34:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:34:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:34:00,540 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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:34:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:02,281 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2024-11-07 07:34:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:34:02,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 103 [2024-11-07 07:34:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:02,283 INFO L225 Difference]: With dead ends: 104 [2024-11-07 07:34:02,283 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 07:34:02,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:34:02,284 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:02,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 466 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:34:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 07:34:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-07 07:34:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.106060606060606) internal successors, (73), 68 states have internal predecessors, (73), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:34:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-11-07 07:34:02,306 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 103 [2024-11-07 07:34:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-11-07 07:34:02,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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:34:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-11-07 07:34:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:34:02,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:02,310 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] [2024-11-07 07:34:02,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:34:02,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2106156818, now seen corresponding path program 1 times [2024-11-07 07:34:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:34:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185942704] [2024-11-07 07:34:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:34:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:34:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:34:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:34:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:34:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:34:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:34:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:34:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:34:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:34:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:34:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:34:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:34:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:34:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:34:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:34:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:34:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:03,673 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:34:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:34:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185942704] [2024-11-07 07:34:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185942704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:34:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:34:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:34:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649084327] [2024-11-07 07:34:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:34:03,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:34:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:34:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:34:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:34:03,675 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:34:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:04,480 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2024-11-07 07:34:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:34:04,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 103 [2024-11-07 07:34:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:04,482 INFO L225 Difference]: With dead ends: 117 [2024-11-07 07:34:04,482 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 07:34:04,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:34:04,482 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 55 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:04,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 559 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:34:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 07:34:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-07 07:34:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 77 states have internal predecessors, (80), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:34:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-11-07 07:34:04,504 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 103 [2024-11-07 07:34:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:04,504 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-11-07 07:34:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:34:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-11-07 07:34:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:34:04,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:04,506 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] [2024-11-07 07:34:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:34:04,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 20776106, now seen corresponding path program 1 times [2024-11-07 07:34:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:34:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892505915] [2024-11-07 07:34:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:34:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:34:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:34:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:34:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:34:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:34:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:34:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:34:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:34:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:34:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:34:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:34:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:34:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:34:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:34:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:34:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:34:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:05,448 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:34:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:34:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892505915] [2024-11-07 07:34:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892505915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:34:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:34:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:34:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852311726] [2024-11-07 07:34:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:34:05,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:34:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:34:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:34:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:34:05,450 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:34:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:05,901 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2024-11-07 07:34:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:34:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 103 [2024-11-07 07:34:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:05,902 INFO L225 Difference]: With dead ends: 125 [2024-11-07 07:34:05,902 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 07:34:05,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:34:05,903 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:05,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 375 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:34:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 07:34:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-11-07 07:34:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 77 states have internal predecessors, (80), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:34:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-11-07 07:34:05,927 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 103 [2024-11-07 07:34:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:05,927 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-11-07 07:34:05,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:34:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-11-07 07:34:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:34:05,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:05,929 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] [2024-11-07 07:34:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:34:05,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1795783468, now seen corresponding path program 1 times [2024-11-07 07:34:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:34:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922641425] [2024-11-07 07:34:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:34:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat