./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.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_codestructure_dependencies_file-34.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', 'ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a'] 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_codestructure_dependencies_file-34.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 ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:55:21,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:55:21,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:55:21,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:55:21,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:55:21,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:55:21,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:55:21,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:55:21,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:55:21,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:55:21,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:55:21,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:55:21,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:55:21,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:55:21,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:55:21,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:55:21,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:55:21,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:55:21,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:55:21,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:55:21,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:55:21,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:55:21,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:55:21,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:55:21,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:55:21,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:21,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:55:21,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:55:21,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:55:21,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:55:21,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:55:21,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:55:21,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:55:21,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:55:21,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:55:21,713 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2024-11-07 03:55:22,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:55:22,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:55:22,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:55:22,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:55:22,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:55:22,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-07 03:55:23,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:55:23,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:55:23,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-07 03:55:23,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ac3f4cb6/a2fbed8eff464bd5b6837327820b9dbc/FLAG6ac87977e [2024-11-07 03:55:23,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ac3f4cb6/a2fbed8eff464bd5b6837327820b9dbc [2024-11-07 03:55:23,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:55:23,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:55:23,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:23,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:55:23,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:55:23,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdbea01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23, skipping insertion in model container [2024-11-07 03:55:23,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:55:23,767 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_codestructure_dependencies_file-34.i[919,932] [2024-11-07 03:55:23,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:23,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:55:23,858 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_codestructure_dependencies_file-34.i[919,932] [2024-11-07 03:55:23,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:23,917 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:55:23,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23 WrapperNode [2024-11-07 03:55:23,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:23,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:23,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:55:23,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:55:23,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,970 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-07 03:55:23,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:23,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:55:23,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:55:23,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:55:23,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:23,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,001 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 03:55:24,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:55:24,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:55:24,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:55:24,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:55:24,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (1/1) ... [2024-11-07 03:55:24,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:55:24,052 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 03:55:24,054 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 03:55:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:55:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:55:24,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:55:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:55:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:55:24,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:55:24,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:55:24,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:55:24,589 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 03:55:24,589 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:55:24,599 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:55:24,600 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:55:24,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:24 BoogieIcfgContainer [2024-11-07 03:55:24,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:55:24,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:55:24,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:55:24,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:55:24,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:55:23" (1/3) ... [2024-11-07 03:55:24,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:24, skipping insertion in model container [2024-11-07 03:55:24,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:23" (2/3) ... [2024-11-07 03:55:24,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:24, skipping insertion in model container [2024-11-07 03:55:24,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:24" (3/3) ... [2024-11-07 03:55:24,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2024-11-07 03:55:24,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:55:24,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:55:24,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:55:24,695 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;@7716784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:55:24,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:55:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 03:55:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 03:55:24,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:24,714 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:24,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:24,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -752802284, now seen corresponding path program 1 times [2024-11-07 03:55:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:24,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145908425] [2024-11-07 03:55:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:24,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:55:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:55:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:55:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:55:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:55:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:55:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:55:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145908425] [2024-11-07 03:55:25,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145908425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:25,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:55:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544820252] [2024-11-07 03:55:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:55:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:55:25,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:55:25,059 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:55:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:25,078 INFO L93 Difference]: Finished difference Result 131 states and 219 transitions. [2024-11-07 03:55:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:55:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-07 03:55:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:25,086 INFO L225 Difference]: With dead ends: 131 [2024-11-07 03:55:25,086 INFO L226 Difference]: Without dead ends: 65 [2024-11-07 03:55:25,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 03:55:25,093 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:25,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:55:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-07 03:55:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-07 03:55:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 03:55:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-11-07 03:55:25,136 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 92 [2024-11-07 03:55:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:25,137 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-11-07 03:55:25,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:55:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-11-07 03:55:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 03:55:25,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:25,142 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:55:25,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1571084566, now seen corresponding path program 1 times [2024-11-07 03:55:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242727730] [2024-11-07 03:55:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:55:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:55:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:55:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:55:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:55:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:55:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:55:25,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:25,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242727730] [2024-11-07 03:55:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242727730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:55:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879512064] [2024-11-07 03:55:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:25,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:55:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:55:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:55:25,694 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:25,855 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2024-11-07 03:55:25,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:55:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 03:55:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:25,858 INFO L225 Difference]: With dead ends: 217 [2024-11-07 03:55:25,858 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 03:55:25,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:55:25,859 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:25,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 313 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:55:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 03:55:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2024-11-07 03:55:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:55:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2024-11-07 03:55:25,884 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 92 [2024-11-07 03:55:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:25,884 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2024-11-07 03:55:25,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2024-11-07 03:55:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 03:55:25,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:25,886 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:55:25,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 682914376, now seen corresponding path program 1 times [2024-11-07 03:55:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780604409] [2024-11-07 03:55:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:55:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:55:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:55:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:55:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:55:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:55:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:55:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780604409] [2024-11-07 03:55:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780604409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:55:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148315008] [2024-11-07 03:55:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:55:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:55:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:55:26,215 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:26,452 INFO L93 Difference]: Finished difference Result 406 states and 619 transitions. [2024-11-07 03:55:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:55:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-07 03:55:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:26,455 INFO L225 Difference]: With dead ends: 406 [2024-11-07 03:55:26,455 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 03:55:26,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:55:26,462 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:26,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 246 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:55:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 03:55:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 129. [2024-11-07 03:55:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:55:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2024-11-07 03:55:26,489 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 93 [2024-11-07 03:55:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2024-11-07 03:55:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2024-11-07 03:55:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 03:55:26,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:26,494 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:26,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:55:26,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1846383539, now seen corresponding path program 1 times [2024-11-07 03:55:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913963876] [2024-11-07 03:55:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:55:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:55:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:55:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:55:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:55:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:55:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:55:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913963876] [2024-11-07 03:55:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913963876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:55:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981445376] [2024-11-07 03:55:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:55:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:55:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:55:30,159 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:32,791 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2024-11-07 03:55:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 03:55:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-07 03:55:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:32,796 INFO L225 Difference]: With dead ends: 384 [2024-11-07 03:55:32,796 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 03:55:32,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:55:32,798 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 253 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:32,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 358 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 03:55:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 03:55:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2024-11-07 03:55:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 130 states have internal predecessors, (182), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 03:55:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-11-07 03:55:32,839 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 94 [2024-11-07 03:55:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:32,839 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-11-07 03:55:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-11-07 03:55:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 03:55:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:32,842 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:55:32,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1588218101, now seen corresponding path program 1 times [2024-11-07 03:55:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624171351] [2024-11-07 03:55:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:55:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:55:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:55:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:55:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:55:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:55:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:55:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624171351] [2024-11-07 03:55:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624171351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:55:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008807592] [2024-11-07 03:55:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:33,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:55:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:55:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:55:33,285 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:33,501 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2024-11-07 03:55:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:55:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-07 03:55:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:33,505 INFO L225 Difference]: With dead ends: 402 [2024-11-07 03:55:33,506 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 03:55:33,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:55:33,508 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:33,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 220 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:55:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 03:55:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 198. [2024-11-07 03:55:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 153 states have internal predecessors, (214), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 03:55:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2024-11-07 03:55:33,543 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 94 [2024-11-07 03:55:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:33,544 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2024-11-07 03:55:33,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 03:55:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2024-11-07 03:55:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 03:55:33,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:33,547 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:55:33,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:33,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:33,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1018473050, now seen corresponding path program 1 times [2024-11-07 03:55:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:33,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529530313] [2024-11-07 03:55:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:33,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:56:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:56:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:56:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:56:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:56:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:56:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:56:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:56:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:56:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:56:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:56:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:56:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:56:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:56:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:56:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529530313] [2024-11-07 03:56:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529530313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:56:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:56:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 03:56:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899816845] [2024-11-07 03:56:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:56:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 03:56:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:56:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 03:56:11,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:56:11,904 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:56:13,029 INFO L93 Difference]: Finished difference Result 334 states and 479 transitions. [2024-11-07 03:56:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 03:56:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-07 03:56:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:56:13,033 INFO L225 Difference]: With dead ends: 334 [2024-11-07 03:56:13,036 INFO L226 Difference]: Without dead ends: 332 [2024-11-07 03:56:13,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-07 03:56:13,038 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 286 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:56:13,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 709 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 03:56:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-07 03:56:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 219. [2024-11-07 03:56:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 174 states have internal predecessors, (245), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 03:56:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2024-11-07 03:56:13,072 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 97 [2024-11-07 03:56:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:56:13,074 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2024-11-07 03:56:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2024-11-07 03:56:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 03:56:13,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:56:13,076 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:56:13,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:56:13,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:56:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:56:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -975671656, now seen corresponding path program 1 times [2024-11-07 03:56:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:56:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584187542] [2024-11-07 03:56:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:56:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:56:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:56:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:56:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:56:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:56:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:56:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:56:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:56:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:56:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:56:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:56:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:56:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:56:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:56:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:56:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:56:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584187542] [2024-11-07 03:56:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584187542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:56:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:56:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 03:56:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221340216] [2024-11-07 03:56:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:56:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 03:56:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:56:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 03:56:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:56:46,912 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:56:48,297 INFO L93 Difference]: Finished difference Result 355 states and 510 transitions. [2024-11-07 03:56:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 03:56:48,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-07 03:56:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:56:48,300 INFO L225 Difference]: With dead ends: 355 [2024-11-07 03:56:48,300 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 03:56:48,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 03:56:48,301 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 319 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 03:56:48,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 601 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 03:56:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 03:56:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 239. [2024-11-07 03:56:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 194 states have (on average 1.407216494845361) internal successors, (273), 194 states have internal predecessors, (273), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 03:56:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 351 transitions. [2024-11-07 03:56:48,328 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 351 transitions. Word has length 97 [2024-11-07 03:56:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:56:48,329 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 351 transitions. [2024-11-07 03:56:48,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 351 transitions. [2024-11-07 03:56:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 03:56:48,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:56:48,330 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:56:48,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:56:48,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:56:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:56:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -670470692, now seen corresponding path program 1 times [2024-11-07 03:56:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:56:48,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105434839] [2024-11-07 03:56:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:56:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:56:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:56:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:56:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:56:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:56:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:56:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:56:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:56:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:56:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:56:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:56:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:56:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:56:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:56:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 03:56:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:56:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105434839] [2024-11-07 03:56:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105434839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:56:48,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:56:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:56:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129876618] [2024-11-07 03:56:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:56:48,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:56:48,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:56:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:56:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:56:48,513 INFO L87 Difference]: Start difference. First operand 239 states and 351 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:56:48,678 INFO L93 Difference]: Finished difference Result 451 states and 661 transitions. [2024-11-07 03:56:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:56:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-07 03:56:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:56:48,682 INFO L225 Difference]: With dead ends: 451 [2024-11-07 03:56:48,682 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 03:56:48,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:56:48,685 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 153 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:56:48,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 341 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:56:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 03:56:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 240. [2024-11-07 03:56:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.405128205128205) internal successors, (274), 195 states have internal predecessors, (274), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 03:56:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 352 transitions. [2024-11-07 03:56:48,715 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 352 transitions. Word has length 97 [2024-11-07 03:56:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:56:48,716 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 352 transitions. [2024-11-07 03:56:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 03:56:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 352 transitions. [2024-11-07 03:56:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 03:56:48,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:56:48,717 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:56:48,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 03:56:48,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:56:48,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:56:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash -512120374, now seen corresponding path program 1 times [2024-11-07 03:56:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:56:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791209294] [2024-11-07 03:56:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:56:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:56:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat