./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.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', 'b32e8f7d0cb6b23b60c1bb82468c80ec3de4569bc8a849244666984882c0607b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.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 b32e8f7d0cb6b23b60c1bb82468c80ec3de4569bc8a849244666984882c0607b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:27:22,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:27:22,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:27:22,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:27:22,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:27:22,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:27:22,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:27:22,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:27:22,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:27:22,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:27:22,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:27:22,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:27:22,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:27:22,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:27:22,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:27:22,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:27:22,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:27:22,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:27:22,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:27:22,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:27:22,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:27:22,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:27:22,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:27:22,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:27:22,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:27:22,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:27:22,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:27:22,432 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 -> b32e8f7d0cb6b23b60c1bb82468c80ec3de4569bc8a849244666984882c0607b [2024-11-07 07:27:22,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:27:22,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:27:22,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:27:22,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:27:22,780 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:27:22,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.i [2024-11-07 07:27:24,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:27:24,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:27:24,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.i [2024-11-07 07:27:24,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8dbf9387/a95c42ddc6ef43b3a0b3f28de5a1605f/FLAG0c6d347bb [2024-11-07 07:27:24,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8dbf9387/a95c42ddc6ef43b3a0b3f28de5a1605f [2024-11-07 07:27:24,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:27:24,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:27:24,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:27:24,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:27:24,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:27:24,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9672c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24, skipping insertion in model container [2024-11-07 07:27:24,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:27:24,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.i[913,926] [2024-11-07 07:27:24,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:27:24,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:27:24,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-52.i[913,926] [2024-11-07 07:27:24,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:27:24,562 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:27:24,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24 WrapperNode [2024-11-07 07:27:24,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:27:24,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:27:24,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:27:24,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:27:24,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,610 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-07 07:27:24,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:27:24,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:27:24,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:27:24,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:27:24,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:27:24,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:27:24,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:27:24,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:27:24,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:27:24,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (1/1) ... [2024-11-07 07:27:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:27:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:27:24,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:27:24,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:27:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:27:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:27:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:27:24,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:27:24,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:27:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:27:24,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:27:24,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:27:24,915 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 07:27:24,915 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:27:24,922 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:27:24,922 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:27:24,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:27:24 BoogieIcfgContainer [2024-11-07 07:27:24,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:27:24,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:27:24,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:27:24,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:27:24,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:27:24" (1/3) ... [2024-11-07 07:27:24,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cfbb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:27:24, skipping insertion in model container [2024-11-07 07:27:24,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:24" (2/3) ... [2024-11-07 07:27:24,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cfbb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:27:24, skipping insertion in model container [2024-11-07 07:27:24,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:27:24" (3/3) ... [2024-11-07 07:27:24,930 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-52.i [2024-11-07 07:27:24,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:27:24,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:27:24,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:27:24,986 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;@773dde52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:27:24,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:27:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 07:27:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 07:27:24,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:24,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:27:24,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash 384959832, now seen corresponding path program 1 times [2024-11-07 07:27:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:27:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529145322] [2024-11-07 07:27:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:25,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:27:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:27:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:27:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:27:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:27:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:27:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:27:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:27:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:27:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:27:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:27:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:27:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:27:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 07:27:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:27:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529145322] [2024-11-07 07:27:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529145322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:27:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:27:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:27:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726314677] [2024-11-07 07:27:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:27:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:27:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:27:25,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:27:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:27:25,268 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 07:27:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:25,286 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-07 07:27:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:27:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2024-11-07 07:27:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:25,292 INFO L225 Difference]: With dead ends: 97 [2024-11-07 07:27:25,293 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 07:27:25,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:27:25,296 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:25,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:27:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 07:27:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 07:27:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 07:27:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-07 07:27:25,329 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 86 [2024-11-07 07:27:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:25,329 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-07 07:27:25,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 07:27:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-07 07:27:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 07:27:25,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:25,332 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:27:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:27:25,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:25,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 260844888, now seen corresponding path program 1 times [2024-11-07 07:27:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:27:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354470541] [2024-11-07 07:27:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:27:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:27:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:27:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:27:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:27:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:27:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:27:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:27:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:27:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:27:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:27:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:27:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:27:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 07:27:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:27:33,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354470541] [2024-11-07 07:27:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354470541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:27:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:27:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:27:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525141553] [2024-11-07 07:27:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:27:33,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:27:33,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:27:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:27:33,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:27:33,157 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:33,849 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2024-11-07 07:27:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:27:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 07:27:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:33,851 INFO L225 Difference]: With dead ends: 205 [2024-11-07 07:27:33,851 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 07:27:33,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-07 07:27:33,853 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 277 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:33,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 328 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:27:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 07:27:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2024-11-07 07:27:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 86 states have internal predecessors, (111), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 07:27:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-07 07:27:33,868 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 86 [2024-11-07 07:27:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-07 07:27:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-07 07:27:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 07:27:33,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:33,871 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:27:33,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:27:33,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:33,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 519010326, now seen corresponding path program 1 times [2024-11-07 07:27:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:27:33,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411460377] [2024-11-07 07:27:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:27:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:27:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:27:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:27:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:27:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:27:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:27:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:27:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:27:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:27:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:27:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:27:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:27:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 07:27:34,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:27:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411460377] [2024-11-07 07:27:34,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411460377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:27:34,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:27:34,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:27:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222626102] [2024-11-07 07:27:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:27:34,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:27:34,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:27:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:27:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:27:34,148 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:34,237 INFO L93 Difference]: Finished difference Result 300 states and 423 transitions. [2024-11-07 07:27:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:27:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 07:27:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:34,240 INFO L225 Difference]: With dead ends: 300 [2024-11-07 07:27:34,240 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 07:27:34,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:27:34,242 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 78 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:34,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:27:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 07:27:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115. [2024-11-07 07:27:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:27:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-11-07 07:27:34,256 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 86 [2024-11-07 07:27:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:34,256 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-11-07 07:27:34,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-11-07 07:27:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 07:27:34,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:34,258 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:27:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:27:34,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:34,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1833572630, now seen corresponding path program 1 times [2024-11-07 07:27:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:27:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2482567] [2024-11-07 07:27:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:27:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:27:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:27:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:27:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:27:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:27:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:27:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:27:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:27:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:27:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:27:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:27:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:27:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 07:27:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:27:34,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2482567] [2024-11-07 07:27:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2482567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:27:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:27:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:27:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844750902] [2024-11-07 07:27:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:27:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:27:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:27:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:27:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:27:34,370 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:34,453 INFO L93 Difference]: Finished difference Result 337 states and 467 transitions. [2024-11-07 07:27:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:27:34,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 07:27:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:34,455 INFO L225 Difference]: With dead ends: 337 [2024-11-07 07:27:34,455 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 07:27:34,456 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 07:27:34,456 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 94 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:34,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 224 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:27:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 07:27:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 118. [2024-11-07 07:27:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:27:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-07 07:27:34,470 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 86 [2024-11-07 07:27:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:34,470 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-07 07:27:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 07:27:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-07 07:27:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 07:27:34,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:34,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:27:34,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:27:34,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:34,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1575407192, now seen corresponding path program 1 times [2024-11-07 07:27:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:27:34,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867271004] [2024-11-07 07:27:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:27:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat