./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-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_no-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', '111d166f25abb14628c4a40c90c27dbe8c1d7bef0615966c9d9ea8064d60e093'] 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_no-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 111d166f25abb14628c4a40c90c27dbe8c1d7bef0615966c9d9ea8064d60e093 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:44:58,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:44:58,754 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:44:58,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:44:58,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:44:58,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:44:58,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:44:58,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:44:58,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:44:58,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:44:58,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:44:58,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:44:58,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:44:58,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:44:58,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:44:58,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:44:58,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:44:58,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:44:58,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:44:58,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:44:58,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:44:58,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:44:58,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:44:58,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:44:58,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:44:58,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:44:58,790 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 -> 111d166f25abb14628c4a40c90c27dbe8c1d7bef0615966c9d9ea8064d60e093 [2024-11-07 07:44:59,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:44:59,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:44:59,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:44:59,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:44:59,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:44:59,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-12.i [2024-11-07 07:45:00,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:45:00,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:45:00,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-12.i [2024-11-07 07:45:00,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03eaeab63/df20a173eb944581b39dcba2ba69f531/FLAGdea2c4b38 [2024-11-07 07:45:00,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03eaeab63/df20a173eb944581b39dcba2ba69f531 [2024-11-07 07:45:00,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:45:00,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:45:00,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:45:00,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:45:00,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:45:00,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d482a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00, skipping insertion in model container [2024-11-07 07:45:00,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:45:00,615 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_no-floats_file-12.i[916,929] [2024-11-07 07:45:00,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:45:00,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:45:00,679 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_no-floats_file-12.i[916,929] [2024-11-07 07:45:00,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:45:00,729 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:45:00,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00 WrapperNode [2024-11-07 07:45:00,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:45:00,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:45:00,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:45:00,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:45:00,744 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:45:00" (1/1) ... [2024-11-07 07:45:00,755 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:45:00" (1/1) ... [2024-11-07 07:45:00,798 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-07 07:45:00,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:45:00,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:45:00,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:45:00,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:45:00,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,837 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:45:00,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:45:00,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:45:00,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:45:00,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:45:00,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (1/1) ... [2024-11-07 07:45:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:45:00,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:45:00,896 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:45:00,906 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:45:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:45:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:45:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:45:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:45:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:45:00,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:45:00,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:45:00,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:45:01,267 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 07:45:01,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:45:01,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:45:01,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:45:01,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:45:01 BoogieIcfgContainer [2024-11-07 07:45:01,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:45:01,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:45:01,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:45:01,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:45:01,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:45:00" (1/3) ... [2024-11-07 07:45:01,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cd02b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:45:01, skipping insertion in model container [2024-11-07 07:45:01,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:45:00" (2/3) ... [2024-11-07 07:45:01,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cd02b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:45:01, skipping insertion in model container [2024-11-07 07:45:01,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:45:01" (3/3) ... [2024-11-07 07:45:01,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-12.i [2024-11-07 07:45:01,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:45:01,296 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:45:01,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:45:01,353 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;@4121c415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:45:01,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:45:01,361 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:45:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:45:01,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:01,371 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:45:01,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:01,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1058777531, now seen corresponding path program 1 times [2024-11-07 07:45:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280772082] [2024-11-07 07:45:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:01,717 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:45:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280772082] [2024-11-07 07:45:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280772082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:45:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497109095] [2024-11-07 07:45:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:45:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:45:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:45:01,752 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:45:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:01,773 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2024-11-07 07:45:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:45:01,775 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:45:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:01,779 INFO L225 Difference]: With dead ends: 93 [2024-11-07 07:45:01,780 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 07:45:01,782 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:45:01,784 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:45:01,784 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:45:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 07:45:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 07:45:01,818 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:45:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-07 07:45:01,826 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 102 [2024-11-07 07:45:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:01,827 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-07 07:45:01,828 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:45:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-07 07:45:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:45:01,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:01,833 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:45:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:45:01,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -13465157, now seen corresponding path program 1 times [2024-11-07 07:45:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634332423] [2024-11-07 07:45:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:04,128 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:45:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634332423] [2024-11-07 07:45:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634332423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:04,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:45:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699366419] [2024-11-07 07:45:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:45:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:45:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:45:04,130 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:45:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:05,334 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2024-11-07 07:45:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:45:05,335 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:45:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:05,336 INFO L225 Difference]: With dead ends: 100 [2024-11-07 07:45:05,338 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 07:45:05,338 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:45:05,339 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 75 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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:45:05,340 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:45:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 07:45:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2024-11-07 07:45:05,365 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:45:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-07 07:45:05,368 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 102 [2024-11-07 07:45:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:05,369 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-07 07:45:05,369 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:45:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-07 07:45:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:45:05,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:05,373 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:45:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:45:05,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash 666593213, now seen corresponding path program 1 times [2024-11-07 07:45:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418472846] [2024-11-07 07:45:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:13,268 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:45:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:13,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418472846] [2024-11-07 07:45:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418472846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:45:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257212923] [2024-11-07 07:45:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:13,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:45:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:45:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:45:13,270 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:45:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:17,891 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-11-07 07:45:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:45:17,892 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:45:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:17,894 INFO L225 Difference]: With dead ends: 91 [2024-11-07 07:45:17,894 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 07:45:17,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:45:17,895 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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:45:17,896 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:45:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 07:45:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-07 07:45:17,907 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:45:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2024-11-07 07:45:17,908 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 102 [2024-11-07 07:45:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2024-11-07 07:45:17,909 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:45:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-11-07 07:45:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:45:17,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:17,910 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:45:17,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:45:17,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:17,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 413803116, now seen corresponding path program 1 times [2024-11-07 07:45:17,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333537414] [2024-11-07 07:45:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:19,099 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:45:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333537414] [2024-11-07 07:45:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333537414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:45:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110155708] [2024-11-07 07:45:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:45:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:45:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:45:19,103 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:45:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:20,753 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2024-11-07 07:45:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:45:20,754 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:45:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:20,755 INFO L225 Difference]: With dead ends: 104 [2024-11-07 07:45:20,756 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 07:45:20,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:45:20,758 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:45:20,758 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:45:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 07:45:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-07 07:45:20,790 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:45:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-11-07 07:45:20,794 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 103 [2024-11-07 07:45:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-11-07 07:45:20,794 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:45:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-11-07 07:45:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:45:20,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:20,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] [2024-11-07 07:45:20,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:45:20,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2106156818, now seen corresponding path program 1 times [2024-11-07 07:45:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221295047] [2024-11-07 07:45:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:22,199 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:45:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221295047] [2024-11-07 07:45:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221295047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:22,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:22,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:45:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565510140] [2024-11-07 07:45:22,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:45:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:45:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:45:22,201 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:45:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:23,629 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2024-11-07 07:45:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:45:23,630 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:45:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:23,632 INFO L225 Difference]: With dead ends: 117 [2024-11-07 07:45:23,632 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 07:45:23,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:45:23,633 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 55 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:23,633 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.9s Time] [2024-11-07 07:45:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 07:45:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-07 07:45:23,662 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:45:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-11-07 07:45:23,663 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 103 [2024-11-07 07:45:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:23,664 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-11-07 07:45:23,664 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:45:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-11-07 07:45:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:45:23,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:23,665 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:45:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:45:23,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash 20776106, now seen corresponding path program 1 times [2024-11-07 07:45:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866888361] [2024-11-07 07:45:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:45:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:45:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:45:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:45:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:45:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:45:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:45:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:45:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:45:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:45:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:45:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:45:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:45:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:45:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:45:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:45:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:24,736 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:45:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:45:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866888361] [2024-11-07 07:45:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866888361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:45:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:45:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:45:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632233451] [2024-11-07 07:45:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:45:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:45:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:45:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:45:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:45:24,737 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:45:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:45:25,009 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2024-11-07 07:45:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:45:25,010 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:45:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:45:25,012 INFO L225 Difference]: With dead ends: 125 [2024-11-07 07:45:25,012 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 07:45:25,012 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:45:25,012 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:45:25,013 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.1s Time] [2024-11-07 07:45:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 07:45:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-11-07 07:45:25,032 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:45:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-11-07 07:45:25,033 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 103 [2024-11-07 07:45:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:45:25,034 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-11-07 07:45:25,034 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:45:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-11-07 07:45:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:45:25,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:45:25,035 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:45:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:45:25,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:45:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:45:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1795783468, now seen corresponding path program 1 times [2024-11-07 07:45:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:45:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239680494] [2024-11-07 07:45:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:45:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:45:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:45:37,572 WARN L286 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 07:45:55,245 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 07:46:22,078 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 07:46:39,984 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)