./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.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_loopvsstraightlinecode_25-while_file-6.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', '2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1'] 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_loopvsstraightlinecode_25-while_file-6.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 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:33:14,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:33:14,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:33:14,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:33:14,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:33:14,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:33:14,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:33:14,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:33:14,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:33:14,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:33:14,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:33:14,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:33:14,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:33:14,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:33:14,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:33:14,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:33:14,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:33:14,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:33:14,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:33:14,609 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 -> 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 [2024-11-07 08:33:14,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:33:14,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:33:14,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:33:14,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:33:14,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:33:14,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-07 08:33:16,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:33:16,377 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:33:16,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-07 08:33:16,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20901a29d/9039eca22507490aa13f508d5d659e52/FLAGb4459b1d6 [2024-11-07 08:33:16,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20901a29d/9039eca22507490aa13f508d5d659e52 [2024-11-07 08:33:16,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:33:16,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:33:16,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:33:16,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:33:16,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:33:16,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18be3941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16, skipping insertion in model container [2024-11-07 08:33:16,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:33:16,830 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_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-07 08:33:16,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:33:16,864 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:33:16,873 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_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-07 08:33:16,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:33:16,898 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:33:16,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16 WrapperNode [2024-11-07 08:33:16,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:33:16,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:33:16,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:33:16,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:33:16,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,941 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-07 08:33:16,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:33:16,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:33:16,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:33:16,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:33:16,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,966 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 08:33:16,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:33:16,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:33:16,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:33:16,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:33:16,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (1/1) ... [2024-11-07 08:33:16,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:33:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:33:17,020 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 08:33:17,022 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 08:33:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:33:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:33:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:33:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:33:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:33:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:33:17,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:33:17,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:33:17,295 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 08:33:17,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:33:17,305 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:33:17,305 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:33:17,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:17 BoogieIcfgContainer [2024-11-07 08:33:17,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:33:17,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:33:17,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:33:17,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:33:17,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:33:16" (1/3) ... [2024-11-07 08:33:17,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e95eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:17, skipping insertion in model container [2024-11-07 08:33:17,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:16" (2/3) ... [2024-11-07 08:33:17,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e95eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:17, skipping insertion in model container [2024-11-07 08:33:17,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:17" (3/3) ... [2024-11-07 08:33:17,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-07 08:33:17,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:33:17,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:33:17,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:33:17,379 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;@5836dcae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:33:17,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:33:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:33:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 08:33:17,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:17,390 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:17,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-11-07 08:33:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657383228] [2024-11-07 08:33:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:33:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:33:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:33:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:33:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:33:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:33:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:33:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:33:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:33:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:33:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:33:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:33:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:33:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 08:33:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657383228] [2024-11-07 08:33:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657383228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:17,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:17,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:33:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67461966] [2024-11-07 08:33:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:17,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:33:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:33:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:33:17,690 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:33:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:17,711 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-11-07 08:33:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:33:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-07 08:33:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:17,718 INFO L225 Difference]: With dead ends: 101 [2024-11-07 08:33:17,718 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 08:33:17,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 08:33:17,722 INFO L432 NwaCegarLoop]: 74 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, 74 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 08:33:17,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:33:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 08:33:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 08:33:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:33:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-11-07 08:33:17,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-11-07 08:33:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-11-07 08:33:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:33:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-07 08:33:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 08:33:17,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:17,756 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:17,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:33:17,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-11-07 08:33:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516684282] [2024-11-07 08:33:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:33:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:33:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:33:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:33:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:33:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:33:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:33:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:33:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:33:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:33:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:33:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:33:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:33:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:33:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:33:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:33:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:33:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:33:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:33:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:33:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 08:33:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:33:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516684282] [2024-11-07 08:33:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516684282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:33:30,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:33:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 08:33:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773497674] [2024-11-07 08:33:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:33:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:33:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:33:30,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:33:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:33:30,897 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 08:33:36,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:33:40,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:33:43,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:33:47,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:33:54,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:33:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:33:57,243 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2024-11-07 08:33:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 08:33:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-11-07 08:33:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:33:57,246 INFO L225 Difference]: With dead ends: 167 [2024-11-07 08:33:57,246 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 08:33:57,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-07 08:33:57,248 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 182 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 62 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:33:57,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 399 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 197 Invalid, 3 Unknown, 0 Unchecked, 21.4s Time] [2024-11-07 08:33:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 08:33:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 56. [2024-11-07 08:33:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:33:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-07 08:33:57,257 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 118 [2024-11-07 08:33:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:33:57,257 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-07 08:33:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 08:33:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-07 08:33:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 08:33:57,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:33:57,259 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:33:57,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:33:57,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:33:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:33:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-11-07 08:33:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:33:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963200704] [2024-11-07 08:33:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:33:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:33:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:34:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:34:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:34:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:34:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:34:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:34:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:34:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:34:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:34:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:34:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:34:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:34:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:34:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:34:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:34:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:34:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:34:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:34:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:34:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 08:34:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:34:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963200704] [2024-11-07 08:34:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963200704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:34:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720849649] [2024-11-07 08:34:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:34:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:34:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:34:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:34:12,631 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:34:33,033 WARN L286 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 131 DAG size of output: 130 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 08:34:34,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:34:47,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 08:34:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:49,110 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2024-11-07 08:34:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:34:49,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-07 08:34:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:49,112 INFO L225 Difference]: With dead ends: 145 [2024-11-07 08:34:49,112 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 08:34:49,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:34:49,113 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 114 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:34:49,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 494 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2024-11-07 08:34:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 08:34:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2024-11-07 08:34:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 08:34:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2024-11-07 08:34:49,153 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 118 [2024-11-07 08:34:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:49,153 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2024-11-07 08:34:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:34:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2024-11-07 08:34:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:34:49,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:49,155 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:49,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:34:49,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-11-07 08:34:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:34:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259029472] [2024-11-07 08:34:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:34:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:34:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:34:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:34:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:34:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:34:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:34:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:34:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:34:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:34:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:34:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:34:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:34:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:34:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:34:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:34:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:34:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:34:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:34:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:34:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 08:34:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:34:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259029472] [2024-11-07 08:34:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259029472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:34:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119310091] [2024-11-07 08:34:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:49,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:34:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:34:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:34:49,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:34:49,382 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 08:34:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:49,615 INFO L93 Difference]: Finished difference Result 292 states and 440 transitions. [2024-11-07 08:34:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:34:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-07 08:34:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:49,618 INFO L225 Difference]: With dead ends: 292 [2024-11-07 08:34:49,618 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 08:34:49,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:34:49,621 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:34:49,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:34:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 08:34:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2024-11-07 08:34:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-07 08:34:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2024-11-07 08:34:49,655 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 119 [2024-11-07 08:34:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2024-11-07 08:34:49,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 08:34:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2024-11-07 08:34:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:34:49,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:49,657 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:34:49,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-11-07 08:34:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:34:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243475220] [2024-11-07 08:34:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:34:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat